Intermediate Sums on Polyhedra: Computation and Real Ehrhart Theory

Reading the bibliography…

Fetching the paper…

Built on

M. Brion, Points entiers dans les polyèdres convexes , Ann. Sci. École Norm. Sup. 21
1988
Earlier work this paper cites.
A. I. Barvinok, Polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed , Mathematics of Operations Research 19
1994
Earlier work this paper cites.
D. Avis and K. Fukuda, Reverse search for enumeration , Discrete Appl. Math. 65
1996
Earlier work this paper cites.
M. Brion and M. Vergne, Residue formulae, vector partition functions and lattice points in rational polytopes , J. Amer. Math. Soc. 10
1997
Earlier work this paper cites.
A. I. Barvinok and J. E. Pommersheim, An algorithmic theory of lattice points in polyhedra , New Perspectives in Algebraic Combinatorics (L. J. Billera, A. Björner, C. Greene, R. E. Simion, and R. P. Stanley, eds.), Math. Sci. Res. Inst. Publ., vol. 38, Cambridge Univ. Press, Cambridge, 1999, pp. 91–147
1999
Earlier work this paper cites.

J. A. De Loera, D. Haws, R. Hemmecke, P. Huggins, J. Tauzer, and R. Yoshida, LattE, version 1.2 , Available from URL http://www.math.ucdavis.edu/~latte/ , 2005
2005
Cited alongside, same era.
by same author, Computing the Ehrhart quasi-polynomial of a rational simplex , Mathematics of Computation 75
2006
Cited alongside, same era.
M. Köppe, A primal Barvinok algorithm based on irrational decompositions , SIAM Journal on Discrete Mathematics 21
2007
Cited alongside, same era.
V. Baldoni, N. Berline, and M. Vergne, Local Euler–Maclaurin expansion of Barvinok valuations and Ehrhart coefficients of rational polytopes , Contemporary Mathematics 452
2008
Cited alongside, same era.
M. Köppe and S. Verdoolaege, Computing parametric rational generating functions with a primal Barvinok algorithm , The Electronic Journal of Combinatorics 15
2008

alphaXiv searches the wider corpus for related work and actual follow-ups.

alphaXiv is searching for related work…

Reading the bibliography…

Intermediate Sums on Polyhedra: Computation and Real Ehrhart Theory · Around

M. Brion, Points entiers dans les polyèdres convexes , Ann. Sci. École Norm. Sup. 21
1988
Earlier work this paper cites.
A. I. Barvinok, Polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed , Mathematics of Operations Research 19
1994
Earlier work this paper cites.
D. Avis and K. Fukuda, Reverse search for enumeration , Discrete Appl. Math. 65
1996
Earlier work this paper cites.
M. Brion and M. Vergne, Residue formulae, vector partition functions and lattice points in rational polytopes , J. Amer. Math. Soc. 10
1997
Earlier work this paper cites.
A. I. Barvinok and J. E. Pommersheim, An algorithmic theory of lattice points in polyhedra , New Perspectives in Algebraic Combinatorics (L. J. Billera, A. Björner, C. Greene, R. E. Simion, and R. P. Stanley, eds.), Math. Sci. Res. Inst. Publ., vol. 38, Cambridge Univ. Press, Cambridge, 1999, pp. 91–147
1999
Earlier work this paper cites.

J. A. De Loera, D. Haws, R. Hemmecke, P. Huggins, J. Tauzer, and R. Yoshida, LattE, version 1.2 , Available from URL http://www.math.ucdavis.edu/~latte/ , 2005
2005
Cited alongside, same era.
by same author, Computing the Ehrhart quasi-polynomial of a rational simplex , Mathematics of Computation 75
2006
Cited alongside, same era.
M. Köppe, A primal Barvinok algorithm based on irrational decompositions , SIAM Journal on Discrete Mathematics 21
2007
Cited alongside, same era.
V. Baldoni, N. Berline, and M. Vergne, Local Euler–Maclaurin expansion of Barvinok valuations and Ehrhart coefficients of rational polytopes , Contemporary Mathematics 452
2008
Cited alongside, same era.
M. Köppe and S. Verdoolaege, Computing parametric rational generating functions with a primal Barvinok algorithm , The Electronic Journal of Combinatorics 15
2008

alphaXiv searches the wider corpus for related work and actual follow-ups.

alphaXiv is searching for related work…