Embedding a Polytope in a Lattice.
H. Maehara (1995)
Discrete & computational geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Computing the Ehrhart Polynomial of a Convex Lattice Polytope.”
Embedding a Polytope in a Lattice.
On Lattice Points in Polyhedral Cross-Sections.
N.M. Korneenko, N.N. Metelskij (1993)
Discrete & computational geometry
Similarity:
On the Number of Convex Lattice Polytopes.
I. Bárány, A.M. Vershik (1992)
Geometric and functional analysis
Similarity:
Universal counting of lattice points in polytopes.
Bárány, Imre, Kantor, Jean-Michel (1999)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Lattice-Free Polytopes and Their Diameter.
M. Deza, S. Onn (1995)
Discrete & computational geometry
Similarity:
An Ehrhart series formula for reflexive polytopes.
Braun, Benjamin (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On lattice polytopes having interior lattice points.
J.M. Wills, J. Zaks, M.A. Perles (1982)
Elemente der Mathematik
Similarity:
Lattice Points in Lattice Polytopes.
P. McMullen, U. Betke (1985)
Monatshefte für Mathematik
Similarity:
On Ray Shooting in Convex Polytopes.
J. Matousek, O. Schwarzkopf (1993)
Discrete & computational geometry
Similarity:
The Ehrhart polynomial of a lattice -simplex.
Diaz, Ricardo, Robins, Sinai (1996)
Electronic Research Announcements of the American Mathematical Society [electronic only]
Similarity:
Successive Minima, Intrinsic Volumes, and Lattice Determinants.
U. Schnell (1995)
Discrete & computational geometry
Similarity:
Valuations and Polarity.
J. Lawrence (1988)
Discrete & computational geometry
Similarity: