Theory of linear and integer programming
Theory of linear and integer programming
Enumerative combinatorics
Ehrhart polynomials of convex polytopes with small volumes
European Journal of Combinatorics
Hi-index | 0.00 |
Let @d(P)=(@d"0,@d"1,...,@d"d) be the @d-vector of an integral polytope P@?R^N of dimension d. Following previous work on the characterization of @d-vectors with @?"i"="0^d@d"i=