The many aspects of counting lattice points in polytopes
- 1 August 2005
- journal article
- Published by Springer Nature in Mathematische Semesterberichte
- Vol. 52 (2) , 175-195
Abstract
No abstract availableKeywords
This publication has 46 references indexed in Scilit:
- The minimum period of the Ehrhart quasi-polynomial of a rational polytopeJournal of Combinatorial Theory, Series A, 2005
- The Ehrhart Polynomial of the Birkhoff PolytopeDiscrete & Computational Geometry, 2003
- Cache miss equationsACM Transactions on Programming Languages and Systems, 1999
- The Ehrhart Polynomial of a Lattice PolytopeAnnals of Mathematics, 1997
- A Lower Bound Theorem for Ehrhart Polynomials of Convex PolytopesAdvances in Mathematics, 1994
- Pick′s Theorem and the Todd Class of a Toric VarietyAdvances in Mathematics, 1993
- A Short Proof of Jacobi's Formula for the Number of Representations of an Integer as a Sum of Four SquaresThe American Mathematical Monthly, 1993
- Lattice points in lattice polytopesMonatshefte für Mathematik, 1985
- Universal diophantine equationThe Journal of Symbolic Logic, 1982
- Combinatorial remarks on partitions of a multipartite numberDuke Mathematical Journal, 1964