Effective lattice point counting in rational convex polytopes
- 1 October 2004
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 38 (4) , 1273-1302
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Short rational functions for toric algebra and applicationsJournal of Symbolic Computation, 2004
- The Ehrhart Polynomial of the Birkhoff PolytopeDiscrete & Computational Geometry, 2003
- Algebraic unimodular countingMathematical Programming, 2003
- Solving the knapsack problem via -transformOperations Research Letters, 2002
- La valeur optimale des programmes entiersComptes Rendus Mathematique, 2002
- Asymptotics of Multivariate SequencesJournal of Combinatorial Theory, Series A, 2002
- Fast Unimodular CountingCombinatorics, Probability and Computing, 2000
- The Kostant partition function for simple Lie algebrasJournal of Mathematical Physics, 1984
- Decompositions of Rational Convex Polytopes1980
- Representations of integers by linear forms in nonnegative integersJournal of Number Theory, 1972