This repository has been archived by the owner on Sep 3, 2018. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathh.html
181 lines (122 loc) · 5.82 KB
/
h.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
<HTML>
<HEAD>
<TITLE>4ti2 -- A software package for algebraic, geometric and combinatorial problems
on linear spaces</TITLE>
</HEAD>
<BODY bgcolor = white>
<h1>
4ti2
</h1>
<h2>
A software package for algebraic, geometric and combinatorial problems
on linear spaces
</h2>
<strong>December 11, 2015: We are happy to release 4ti2 version 1.6.7!</strong>
<p><font color=red>Be invited to <a href="download.html">download 4ti2</a>
or have a look at our <a href="4ti2_manual.pdf">manual</a>!</font><p>
<pre>
News in 4ti2 version 1.6.7, compared to 1.6.6:
* Add missing amsabbrvurl.bst file required for rebuilding the documentation.
Reported by Jerome Benoit for Debian.
* Add tests for "walk -p arb" to testsuite
* Build fix for Debian bug 801117 (underlinked library).
Patch from Jerome Benoit.
* Fix division-by-zero in "walk -p arb" for testcase 344.
Reported by Jerome Benoit for Debian.
News in 4ti2 version 1.6.6, compared to 1.6.5:
* Fix segfault in graver when a matrix with trivial kernel is input
(testcase graver/trivial-kernel).
Reported by Alfredo Sanchez.
News in 4ti2 version 1.6.5, compared to 1.6.4:
* Fix build failure with gcc 4.9.2.
News in 4ti2 version 1.6.4, compared to 1.6.3:
* Improved error checking while reading zsolve input files.
Reported by Sebastian Gutsche.
* The PDF manual has been updated to include a reference to commands
and their options and a reference to the API. The command
reference on www.4ti2.de has also been updated.
* Better option handling. Make long options available in non-GNU
platforms such as Mac OS X. All commands now support the
standard --help and --version options.
* Minor fix to the test suite.
Reported by Luis David Garcia-Puente.
News in 4ti2 version 1.6.3, compared to 1.6.2:
* The manual has been updated.
* Minor build fixes.
News in 4ti2 version 1.6.2, compared to 1.6.1:
* Use GLPK's new glp_* API instead of the old lpx_* API (declared
obsolete in glpk 4.47 and removed in 4.52).
(Patch by Jerry James for Fedora.)
News in 4ti2 version 1.6.1, compared to 1.6:
* Compile fix for XCode 5.0.2, Apple LLVM version 5.0 (clang-500.2.79).
News in 4ti2 version 1.6, compared to 1.5.2:
* Restore the functionality of "hilbert" in versions up to 1.3.2 to
accept "rel" files. This signalled an error in the 1.4 and 1.5 series.
(Note that "zsolve" did accept "rel" files in the 1.4 and 1.5 series.)
* When the cone is not pointed, "hilbert" now outputs a "zfree" file,
containing a lattice basis, in addition to the "hil" file.
Note that in the non-pointed case, Hilbert bases are not uniquely
determined. Let zfree_1, ..., zfree_k be the vectors in the "zfree"
file and hil_1, ..., hil_l be the vectors in the "hil" file.
Then a Hilbert basis of the non-pointed cone is
hil_1, ..., hil_l, -(hil_1 + ... + hil_l), zfree_1, ..., zfree_k.
(In the 1.3 series, "hilbert" silently appended the lattice
generators to the "hil" file. Thus the list of vectors in the
"hil" file was not a Hilbert basis of the non-pointed cone; this
was a bug. Note that "zsolve" did work correctly in the 1.3
series.)
* Fix a bug of zsolve and hilbert on 64-bit platforms (where
sizeof(unsigned long) > sizeof(int)), which affected problems with
more than 32 variables and could lead to wrong results. (Testcases
a1, dutour-testcase-2013-08-21).
* Accept longer filenames.
* Enable shared library builds on the Cygwin platform (using the
libtool -no-undefined flag). (However, this requires that shared
libraries of GMP, GLPK are available.)
* Use gnulib to provide getopt_long if not available in the
system libraries.
* If the C++ compiler does not have int32_t and int64_t, use int and
long int instead.
* Fixed bug in lattice transformation with too few rows.
(Reported by Jerry James for Fedora.)
* Fix a build failure with gcc 4.7.
(Patch by Jerry James for Fedora.)
News in 4ti2 version 1.5.2, compared to 1.5.1:
* Build a GMP-only 4ti2 if the C++ compiler does not have int32_t and int64_t.
News in 4ti2 version 1.5.1, compared to 1.5:
* Fix a build problem with --enable-shared.
News in 4ti2 version 1.5, compared to 1.4:
* Latest version of new qsolve.
News in 4ti2 version 1.4, compared to 1.3.2:
* Portability fixes
* New abstract C and C++ API (callable library), header files in 4ti2/
* New implementation of zsolve in C++
</pre>
<b>Changes in version 1.3.2</b><p>
This release fixes minor bugs and portability problems. It is a source-only
release, using a new build system (GNU Autotools). It has been tested
on GNU/Linux (i386 and AMD64 architectures), Windows (with Cygwin),
Solaris (SPARC), and Mac OS X.
<ul>
<li> Fixed bug in `markov' for computing with inhomogeneous lattice ideals for unsaturated lattices.
<li> Fixed bug in `minimize' for determining whether a cost function is bounded or not.
</ul>
<p>
<b>New functionality in version 1.3.1</b><p>
There are quite some changes and new functions with this version (compared to version 1.2).<p>
<a href="Tutorial-Problems.pdf">IMA tutorial problems</a><br>
<a href="IMA_25Oct2006.pdf">Talk at IMA, 25 October, 2006</a><p>
<ul>
<li> 'groebner' and 'markov' are again heavily improved.
<li> 'groebner' and 'markov' allow non-homogeneous lattice ideals.
<li> 'groebner' and 'markov' allow truncation.
<li> There is a new function 'walk' performing a Gröbner walk.
<li> There are new functions 'qsolve' and 'zsolve' for solving linear
systems over the reals or the integers, respectively.
<li> There are new functions 'rays' and 'circuits' to compute extreme rays
and circuits.
<li> The functions 'circuits' and 'graver' allow to fix certain orthants.
<li> One may compute with projections by specifying variables to be ignored.
<li> There is a new function 'minimize' to solve integer linear programs.
</ul>
</BODY>