2 date: Wed Jul 22 15:14:01 CEST 2009
3 - new version of Laurent expansion based exact summation
4 - minor compilation and bug fixes
5 - add semigroup_holes application
6 - add vector_partition_chambers application
9 date: Thu Oct 16 21:56:01 CEST 2008
11 - add omega as submodule
12 - minor compilation and bug fixes
15 date: Sun May 4 23:42:49 CEST 2008
17 - add Parker's library for DFA based counting
18 - support nested sums based exact summation
19 - support Laurent expansion based exact summation
20 - handle equalities and factors in summation
21 - support range propagation for computing bounds
22 - support computation of exact bound through iteration
23 - fix conversion from GiNaC's numeric to Values
26 date: Wed Jan 16 23:45:17 CET 2008
28 - support computation of generating functions in barvinok_enumerate_e
29 - support polymake 2.3
30 - support GiNaC 1.3.8 and newer
31 - support summation using Bernoulli formula
32 - add and use zsolve from 4ti2 for computing Hilbert bases of cones
33 - support use of piplib for solving LPs
34 - add polyhedron_integer_hull and polytope_minimize
35 - add polytope_lattice_width for computing the lattice widths of polytopes
38 date: Tue Sep 11 22:02:22 CEST 2007
40 - add PolyLib and piplib as submodules
41 - remove compatibility with old versions of PolyLib and piplib
42 - support use of piplib for basis reduction
43 - support summation using local Euler-Maclaurin formula for 2D polytopes
44 - support TOPCOM based chamber decompositions
45 - simplify primal decomposition
48 date: Sat Jun 30 23:37:31 CEST 2007
50 - support exponential (Todd) substitution for non-parametric problems
51 - support primal and stopped decomposition on parametric problems
52 - support nested sums polynomial approximation of quasi-polynomials
53 - add barvinok_summate for summating a polynomial over a polytope
54 - speed improvements in barvinok_count and polyhedron_sample
57 date: Sat Apr 28 20:10:35 CEST 2007
59 - use arpg for argument parsing in most commands
61 support polynomial approximations of quasi-polynomials, including
62 volume computation, Meister's method and replacing fractional parts
64 - add barvinok_maximize for computing upper (and lower) bounds
65 - support non-parametric primal and stopped Barvinok decomposition
66 - periodic number representation now run-time configurable
67 - drop support for ancient PolyLib versions
68 - simplified partitioning of chamber complex
69 - add evalue_eval, an exact version of copmute_evalue
70 - improved handling of large generating functions
71 - integrate barvinok_series functionality into barvinok_enumerate
72 - support use of cdd for solving LPs in basis reduction
73 - initial support for computing bounds over quasi-polynomials
74 - recursive Bernstein expansion
75 - corrections and improvements of lexmin
76 - optionally print quasi-polynomial as list of polynomials
77 - add some documentation
80 date: Tue Oct 31 23:15:15 CET 2006
82 - include bernstein library with interface to barvinok and occ
84 - barvinok_count now only returns -1 for unbounded polyhedra with integer points
85 - preliminary implementation of projection via neighborhood complexes
86 - implement generalized basis reduction
87 - add polyhedron_sample
90 - some internal reorganization
91 - some gen_fun clean-ups and optimizations
92 - plug some memory leaks
93 - fix some corner cases
94 - shared libraries are no longer built by default
95 - introduce barvinok_options to pass to functions instead of just MaxRays
96 - use same LLL reduction parameter that LattE uses
97 - add some documentation
100 date: Thu Jun 22 20:49:11 CEST 2006
102 - add some documentation
103 - add barvinok_ehrhart
104 - add h_star_vector polymake client
105 - fix some corner cases
106 - more experimental support for enumerating unions of polytopes
107 - rename cdd2polylib.pl to latte2polylib.pl
110 date: Wed Feb 22 12:01:23 CET 2006
112 - fix PIP-based reduction by removing some code and assuming a recent PIP
113 - some memory leaks plugged
114 - optionally use Omega as a preprocessor in barvinok_enumerate_e
115 - integrate verif_ehrhart_e into barvinok_enumerate_e
116 - barvinok_series handles more problem with equalities
117 - add gen_fun::Hadamard_product
118 - experimental support for enumerating unions of polytopes
121 date: Fri Jan 20 22:14:44 CET 2006
123 - include Omega Calculator interface occ
124 - print_enode creates parameter names if none are provided
125 - only use PIP to project out some variables
126 - some header file fixes
130 date: Thu Sep 15 11:27:19 CEST 2005
132 - factor polyhedra into independent parts before enumeration
133 - make "random vector" specialization more robust
134 - speed up verif_ehrhart by only checking inside the context
135 - remove {Param,}Polyhedron_Reduce
136 - rename triangularize_cone to triangulate_cone
137 - generalize computation of lexmin/max using PIP
138 - compute the number of lexsmaller elements using PolyLib's LexSmaller
141 date: Mon Aug 1 12:23:50 CEST 2005
143 - fix some configuration problems
144 - include minimal polymake client
147 date: Thu Jun 30 12:10:29 CEST 2005
149 - implement "breadth-first" incremental specialization
150 - implement non-incremental version for series computation
151 - make non-incremental specialization the default again
152 - check for bad PolyLib version at runtime
153 - compiles on Windows (mingw32)
155 - allow crosscompilation
156 - compute the coefficients of an Ehrhart series
157 - fix conversion of PIP output to polyhedra
158 - allow direct verification of Ehrhart series
161 date: Sun Dec 12 23:00:40 CET 2004
163 - export Polyhedron_Project
164 - allow verification of step-functions computed from Ehrhart series
165 - optionally compute step-functions incrementally
166 - disable possibly incorrect optimization
167 - minor optimizations in Ehrhart series computations
170 date: Wed Nov 17 19:22:23 CET 2004
172 - use code for computing series to count non-parametric polytopes
173 - add conversion from series to explicit function
174 - fix removal of redundant equalities
177 date: Sat Oct 16 12:13:30 CEST 2004
179 - use slightly larger random numbers
180 - change basis to remove existential variable
181 - fix bug in reduction
182 - handle empty PIP solution
183 - add utility to remove equalities
186 date: Sun Oct 3 20:47:11 CEST 2004
188 - reduce memory requirements
190 - add patch for NTL 5.3.2
191 - experimental support for Ehrhart series
192 - compile fix on systems that lack <getopt.h>
195 date: Sat Sep 18 14:49:40 CEST 2004
198 - find and use PIP if available
199 - don't overallocate matrices on newer PolyLibs
200 - verification program for enumeration of integer projections
201 - summation of enumerations
203 - support older versions of GMP
206 date: Tue Jul 6 22:09:11 CEST 2004
208 - install header files
209 - modulo representation changed to fractionals
210 - perform some simplifications on the modulo representation
211 - barvinok_enumerate returns a malloc'ed evalue
212 - a few bugs in barvinok_enumerate_e removed
213 - optionally print an indication of the size of an enumeration
215 - bug in triangularization fixed
216 - bug in polyhedron reduction fixed
217 - verif_ehrhart.c should compile on C89 systems again
221 - bug in polyhedron reduction fixed
224 date: Sun Feb 22 21:15:00 CET 2004
226 - remove remaining part of Kristof's Ehrhart manipulation code
227 - optimize modulo expression based on validity domain
228 - support partition evalues
229 - factor out 1D polytopes
230 - validity domains can now be unions of polytopes
231 - optionally convert modulo representation to lookup-table
232 - rename indicator to relation
237 - support "indicator" evalues
238 - support equalities for modulo representation
242 - remove part of Kristof's Ehrhart manipulation code
243 - partial support for modulo representation
244 - support cvs version of PolyLib
247 date: Thu Nov 27 13:35:59 CET 2003
250 include code from Kristof Beyls for manipulating Ehrhart
253 implement barvinok_enumerate for constructing Ehrhart
254 polynomials using barvinok's algorithm
257 date: Thu Nov 6 01:36:25 CET 2003
260 allow specification of max #constraints
261 for those without automatically growing chernikova tables
262 - fix a few small bugs
263 - some minor optimizations
266 date: Mon Nov 3 16:35:57 CET 2003
268 - fix a number of bugs
272 date: Mon Oct 20 14:15:45 CEST 2003
274 - change name from count to barvinok_count
275 - return -1 if polyhedron is unbounded
276 - trivially optimize counting in presence of some independent constraints