Skip to content

Commit 3d04049

Browse files
committed
Update
1 parent 78cace6 commit 3d04049

20 files changed

+660
-5
lines changed

.gitattributes

+16
Original file line numberDiff line numberDiff line change
@@ -7,6 +7,7 @@ articles/data/32x80.mar.gz -text
77
articles/data/3cex.html -text
88
articles/data/index.html -text
99
/back.jpg -text
10+
/circuits.html -text
1011
examples/333 -text
1112
examples/333.mod -text
1213
examples/334 -text
@@ -45,6 +46,18 @@ examples/magic5x5 -text
4546
examples/magic6x6 -text
4647
examples/s-magic3 -text
4748
examples/twistedCubic -text
49+
/genmodel.html -text
50+
/gensymm.html -text
51+
/graver.html -text
52+
/groebner.html -text
53+
/hilbert.html -text
54+
/markov.html -text
55+
/minimize.html -text
56+
/normalform.html -text
57+
/output.html -text
58+
/ppi.html -text
59+
/qsolve.html -text
60+
/rays.html -text
4861
version_1.0/4ti2_linux_1.0.tar.gz -text
4962
version_1.0/4ti2_sun_1.0.tar.gz -text
5063
version_1.0/graver -text
@@ -84,3 +97,6 @@ version_1.6.1/4ti2-1.6.1.tar.gz -text
8497
version_1.6.2/4ti2-1.6.2.tar.gz -text
8598
version_1.6.3/4ti2-1.6.3.tar.gz -text
8699
version_1.6/4ti2-1.6.tar.gz -text
100+
/walk.html -text
101+
/zbasis.html -text
102+
/zsolve.html -text

4ti2_manual.pdf

61 KB
Binary file not shown.

circuits.html

+35
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
<pre>
2+
<!--- Autogenerated, do not edit. -->
3+
Usage: circuits [options] PROJECT
4+
5+
Computes the circuits of a cone.
6+
7+
Input Files:
8+
PROJECT.mat A matrix (compulsory).
9+
PROJECT.sign The sign constraints of the variables ('1' means
10+
non-negative, '0' means a free variable, and '2' means
11+
both non-negative and non-positive).
12+
It is optional, and the default is both.
13+
PROJECT.rel The relations on the matrix rows ('<','>','=').
14+
It is optional and the default is all '='.
15+
The mat must be given with this file.
16+
Output Files:
17+
PROJECT.cir The circuits of the cone.
18+
PROJECT.qfree A basis for the linear subspace of the cone.
19+
If this file does not exist then the linear subspace
20+
is trivial.
21+
22+
Options:
23+
-p, --precision=PREC Select PREC as the integer arithmetic precision.
24+
PREC is one of the following: `64' (default),
25+
`32', and `arbitrary' (only `arb` is needed).
26+
-m, --mat Use the Matrix algorithm (default for 32 and 64).
27+
-s, --support Use the Support algorithm (default for arbitrary).
28+
-o, --order=ORDERING Set ORDERING as the ordering in which the columns
29+
are chosen. The possible orderings are `maxinter',
30+
`minindex', `maxcutoff' (default), and `mincutoff'.
31+
-f, --output-freq=n Set the frequency of output (default is 1000).
32+
-q, --quiet Do not output anything to the screen.
33+
-h, --help Display this help and exit.
34+
35+
</pre>

examples.html

+2
Original file line numberDiff line numberDiff line change
@@ -51,6 +51,8 @@
5151

5252
</ul>
5353

54+
The 4ti2 source distribution has many more example files
55+
in its test suite, which can be found in the directory <i>test</i>.
5456

5557

5658
</BODY>

genmodel.html

+39
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,39 @@
1+
<pre>
2+
<!--- Autogenerated, do not edit. -->
3+
usage: genmodel [--options] FILENAME
4+
5+
Computes the problem matrix corresponding to graphical statistical models
6+
given by a simplicial complex and levels on the nodes.
7+
8+
Options:
9+
-q, --quiet No output is written to the screen
10+
11+
Input file:
12+
FILENAME.mod Simplicial complex and levels on the nodes
13+
14+
Output file:
15+
FILENAME.mat Matrix file
16+
17+
Example: Consider the problem of 3x3x3 tables with 2-marginals. These
18+
are given by K_3 as the simplicial complex on 3 nodes and with levels
19+
of 3 on each node. In '333.mod' write:
20+
3
21+
3 3 3
22+
3
23+
2 1 2
24+
2 2 3
25+
2 3 1
26+
Calling 'genmodel 333' produces the following file '333.mat':
27+
27 27
28+
1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0
29+
0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0
30+
[...]
31+
1 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
32+
0 1 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
33+
0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
34+
[...]
35+
1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
36+
0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
37+
[...]
38+
39+
</pre>

gensymm.html

+30
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,30 @@
1+
<pre>
2+
<!--- Autogenerated, do not edit. -->
3+
usage: gensymm [--options] A B C D FILENAME
4+
5+
Computes the generators for the symmetry group acting on 4-way tables
6+
with 3-marginals. By putting one side length to 1, this includes
7+
3-way tables with 2-marginals.
8+
9+
Options:
10+
-q, --quiet No output is written to the screen
11+
12+
Output file:
13+
FILENAME.sym generators for the symmetry group
14+
15+
Example: Consider the problem of 3x3x3 tables with 2-marginals. Calling
16+
gensymm 3 3 3 1 333
17+
produces the file '333.sym' containing the following lines.
18+
19+
9 27
20+
10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 1 2 3 4 5 6 7 8 9
21+
10 11 12 13 14 15 16 17 18 1 2 3 4 5 6 7 8 9 19 20 21 22 23 24 25 26 27
22+
4 5 6 7 8 9 1 2 3 13 14 15 16 17 18 10 11 12 22 23 24 25 26 27 19 20 21
23+
4 5 6 1 2 3 7 8 9 13 14 15 10 11 12 16 17 18 22 23 24 19 20 21 25 26 27
24+
2 3 1 5 6 4 8 9 7 11 12 10 14 15 13 17 18 16 20 21 19 23 24 22 26 27 25
25+
2 1 3 5 4 6 8 7 9 11 10 12 14 13 15 17 16 18 20 19 21 23 22 24 26 25 27
26+
1 2 3 10 11 12 19 20 21 4 5 6 13 14 15 22 23 24 7 8 9 16 17 18 25 26 27
27+
1 10 19 4 13 22 7 16 25 2 11 20 5 14 23 8 17 26 3 12 21 6 15 24 9 18 27
28+
1 4 7 2 5 8 3 6 9 10 13 16 11 14 17 12 15 18 19 22 25 20 23 26 21 24 27
29+
30+
</pre>

graver.html

+46
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,46 @@
1+
<pre>
2+
<!--- Autogenerated, do not edit. -->
3+
Usage: graver [options] PROJECT
4+
5+
Computes the Graver basis of a matrix or a given lattice.
6+
7+
Basic options:
8+
-p PREC, --precision=PREC Use precision (32, 64, gmp). Default is 32 bit
9+
-m, --maxnorm Write vectors with maximum norm to PROJECT.maxnorm
10+
-b [FREQ], --backup[=FREQ] Frequently backup status to PROJECT.backup
11+
-r, --resume Resume from backup file PROJECT.backup
12+
-h, --help Display this help
13+
--version Display version information
14+
15+
Output options:
16+
-q, --quiet Quit mode
17+
-u, --update[=1] Updated output on console (default)
18+
-uu, --update=2 More verbose updated output on console
19+
-v, --verbose[=1] Output once every variable computation
20+
-vv, --verbose=2 Output once every norm sum computation
21+
-vvv, --verbose=3 Output once every norm computation
22+
23+
Logging options:
24+
-n, --log=0 Disable logging (default)
25+
-l, --log[=1] Log once every variable computation to PROJECT.log
26+
-ll, --log=2 Log once every norm sum computation to PROJECT.log
27+
-lll, --log=3 Log once every norm computation to PROJECT.log
28+
29+
Input files:
30+
PROJECT.mat Matrix
31+
PROJECT.lat Lattice basis (can be provided instead of matrix)
32+
PROJECT.sign Sign of columns (optional)
33+
PROJECT.lb Lower bounds of columns (optional)
34+
PROJECT.ub Upper bounds of columns (optional)
35+
36+
Backup files:
37+
PROJECT.backup Backup file
38+
PROJECT.backup~ Temporary backup file
39+
(if it exists, it may be newer than PROJECT.backup)
40+
41+
Output files:
42+
PROJECT.gra Graver basis
43+
PROJECT.zfree Free part of the solution
44+
PROJECT.maxnorm Vectors with maximum norm (if -m, --maxnorm is in use)
45+
46+
</pre>

groebner.html

+50
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,50 @@
1+
<pre>
2+
<!--- Autogenerated, do not edit. -->
3+
Usage: groebner [options] PROJECT
4+
5+
Computes a Groebner basis of the toric ideal of a matrix,
6+
or, more general, of the lattice ideal of a lattice.
7+
8+
Input Files:
9+
PROJECT.mat A matrix (optional if lattice basis is given).
10+
PROJECT.lat A lattice basis (optional if matrix is given).
11+
PROJECT.cost The cost matrix, which determines the term ordering
12+
(optional, default is degrevlex).
13+
Ties are broken with degrevlex.
14+
PROJECT.sign The sign constraints of the variables ('1' means
15+
non-negative and '0' means a free variable).
16+
It is optional, and the default is all non-negative.
17+
PROJECT.mar The Markov basis/generating set of the lattice (optional).
18+
PROJECT.weights The weight vectors used for truncation (optional).
19+
PROJECT.weights.max The maximum weights used for truncation.
20+
This file is needed when PROJECT.weights exists.
21+
PROJECT.zsol An integer solution to specify a fiber (optional).
22+
The integer solution is used for truncation.
23+
Output Files:
24+
PROJECT.gro The Groebner basis of the lattice.
25+
26+
Options:
27+
-p, --precision=PREC Select PREC as the integer arithmetic precision.
28+
PREC is one of the following: `64' (default),
29+
`32', and `arbitrary' (only `arb` is needed).
30+
-a, --algorithm=ALG Select ALG as the completion procedure for
31+
computing Groebner bases. ALG is one of
32+
`fifo', `weighted', or 'unbounded.'
33+
-g, --generation=ALG Select ALG as the procedure for computing
34+
a generating set or Markov basis. ALG is
35+
one of `hybrid' (default), `project-and-lift',
36+
`max-min', or 'saturation'.
37+
-t, --truncation=TRUNC Set TRUNC as the truncation method. TRUNC is
38+
of the following: `ip', `lp', `weight' (default),
39+
or `none'. Only relevant if `zsol' is given.
40+
-m, --minimal=STATE If STATE is `yes' (default), then 4ti2 will
41+
compute a minimal Markov basis. If STATE is
42+
'no', then the Markov basis will not
43+
necessarily be minimal.
44+
-r, --auto-reduce-freq=n Set the frequency of auto reduction.
45+
(default is 2500).
46+
-f, --output-freq=n Set the frequency of output (default is 1000).
47+
-q, --quiet Do not output anything to the screen.
48+
-h, --help Display this help and exit.
49+
50+
</pre>

hilbert.html

+46
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,46 @@
1+
<pre>
2+
<!--- Autogenerated, do not edit. -->
3+
Usage: hilbert [options] PROJECT
4+
5+
Computes the Hilbert basis of a matrix or a given lattice.
6+
7+
Basic options:
8+
-p PREC, --precision=PREC Use precision (32, 64, gmp). Default is 32 bit
9+
-m, --maxnorm Write vectors with maximum norm to PROJECT.maxnorm
10+
-b [FREQ], --backup[=FREQ] Frequently backup status to PROJECT.backup
11+
-r, --resume Resume from backup file PROJECT.backup
12+
-h, --help Display this help
13+
--version Display version information
14+
15+
Output options:
16+
-q, --quiet Quit mode
17+
-u, --update[=1] Updated output on console (default)
18+
-uu, --update=2 More verbose updated output on console
19+
-v, --verbose[=1] Output once every variable computation
20+
-vv, --verbose=2 Output once every norm sum computation
21+
-vvv, --verbose=3 Output once every norm computation
22+
23+
Logging options:
24+
-n, --log=0 Disable logging (default)
25+
-l, --log[=1] Log once every variable computation to PROJECT.log
26+
-ll, --log=2 Log once every norm sum computation to PROJECT.log
27+
-lll, --log=3 Log once every norm computation to PROJECT.log
28+
29+
Input files:
30+
PROJECT.mat Matrix
31+
PROJECT.lat Lattice basis (can be provided instead of matrix)
32+
PROJECT.rel Relations (<, >, =)
33+
PROJECT.sign Sign of columns (optional)
34+
PROJECT.ub Upper bounds of columns (optional)
35+
36+
Backup files:
37+
PROJECT.backup Backup file
38+
PROJECT.backup~ Temporary backup file
39+
(if it exists, it may be newer than PROJECT.backup)
40+
41+
Output files:
42+
PROJECT.hil Hilbert basis
43+
PROJECT.zfree Free part of the solution
44+
PROJECT.maxnorm Vectors with maximum norm (if -m, --maxnorm is in use)
45+
46+
</pre>

markov.html

+45
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,45 @@
1+
<pre>
2+
<!--- Autogenerated, do not edit. -->
3+
Usage: markov [options] PROJECT
4+
5+
Computes a Markov basis (generating set) of the toric ideal
6+
of a matrix or, more general, of the lattice ideal of a lattice.
7+
8+
Input Files:
9+
PROJECT A matrix (optional only if lattice basis is given).
10+
PROJECT.lat A lattice basis (optional only if matrix is given).
11+
PROJECT.sign The sign constraints of the variables ('1' means
12+
non-negative and '0' means a free variable).
13+
It is optional, and the default is all non-negative.
14+
PROJECT.weights The weight vectors used for truncation (optional).
15+
PROJECT.weights.max The maximum weights used for truncation.
16+
This file is needed when PROJECT.weights exists.
17+
PROJECT.zsol An integer solution to specify a fiber (optional).
18+
The integer solution is used for truncation.
19+
Output Files:
20+
PROJECT.mar The Markov basis/generating set of the lattice.
21+
Options:
22+
-p, --precision=PREC Select PREC as the integer arithmetic precision.
23+
PREC is one of the following: `64' (default),
24+
`32', and `arbitrary' (only `arb` is needed).
25+
-a, --algorithm=ALG Select ALG as the completion procedure for
26+
computing Groebner bases. ALG is one of
27+
`fifo', `weighted', or 'unbounded.'
28+
-g, --generation=ALG Select ALG as the procedure for computing
29+
a generating set or Markov basis. ALG is
30+
one of `hybrid' (default), `project-and-lift',
31+
`max-min', or 'saturation'.
32+
-t, --truncation=TRUNC Set TRUNC as the truncation method. TRUNC is
33+
of the following: `ip', `lp', `weight' (default),
34+
or `none'. Only relevant if `zsol' is given.
35+
-m, --minimal=STATE If STATE is `yes' (default), then 4ti2 will
36+
compute a minimal Markov basis. If STATE is
37+
'no', then the Markov basis will not
38+
necessarily be minimal.
39+
-r, --auto-reduce-freq=n Set the frequency of auto reduction.
40+
(default is 2500).
41+
-f, --output-freq=n Set the frequency of output (default is 1000).
42+
-q, --quiet Do not output anything to the screen.
43+
-h, --help Display this help and exit.
44+
45+
</pre>

minimize.html

+35
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
<pre>
2+
<!--- Autogenerated, do not edit. -->
3+
Usage: minimize [options] PROJECT
4+
5+
Computes the minimal solution of an integer linear program
6+
or, more general, a lattice program, using a Groebner basis.
7+
8+
Input Files:
9+
PROJECT.mat A matrix (optional only if lattice basis is given).
10+
PROJECT.lat A lattice basis (optional only if matrix is given).
11+
PROJECT.cost The cost vector. Exactly one vector allowed.
12+
PROJECT.zsol An integer solution to specify a fiber (needed).
13+
PROJECT.sign The sign constraints of the variables ('1' means
14+
non-negative and '0' means a free variable).
15+
It is optional, and the default is all non-negative.
16+
Output Files:
17+
PROJECT.min The minimal solution for the given fiber.
18+
19+
Options:
20+
-p, --precision=PREC Select PREC as the integer arithmetic precision.
21+
PREC is one of the following: `64' (default),
22+
`32', and `arbitrary' (only `arb` is needed).
23+
-a, --algorithm=ALG Select ALG as the completion procedure for
24+
computing Groebner bases. ALG is one of
25+
`fifo', `weighted', or 'unbounded.'
26+
-t, --truncation=TRUNC Set TRUNC as the truncation method. TRUNC is
27+
of the following: `ip', `lp', `weight' (default),
28+
or `none'. Only relevant if `zsol' is given.
29+
-r, --auto-reduce-freq=n Set the frequency of auto reduction.
30+
(default is 2500).
31+
-f, --output-freq=n Set the frequency of output (default is 1000).
32+
-q, --quiet Do not output anything to the screen.
33+
-h, --help Display this help and exit.
34+
35+
</pre>

0 commit comments

Comments
 (0)