Lattice-Free Polytopes and Their Diameter.
M. Deza, S. Onn (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.
The search session has expired. Please query the service again.
Displaying similar documents to “Normal polytopes, triangulations, and Koszul algebras.”
Lattice-Free Polytopes and Their Diameter.
Embedding a Polytope in a Lattice.
H. Maehara (1995)
Discrete & computational geometry
Similarity:
Lattice Points in Lattice Polytopes.
P. McMullen, U. Betke (1985)
Monatshefte für Mathematik
Similarity:
On the Number of Convex Lattice Polytopes.
I. Bárány, A.M. Vershik (1992)
Geometric and functional analysis
Similarity:
On lattice polytopes having interior lattice points.
J.M. Wills, J. Zaks, M.A. Perles (1982)
Elemente der Mathematik
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:
The lattice polytope problem.
Gregg N. Patruno (1983)
Elemente der Mathematik
Similarity:
An Ehrhart series formula for reflexive polytopes.
Braun, Benjamin (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rank forms, closed zones and laminae
Michel Deza, Viatcheslav Grishukhin (2002)
Journal de théorie des nombres de Bordeaux
Similarity:
For a given lattice, we establish an equivalence between closed zones for the corresponding Voronoï polytope, suitable hyperplane sections of the corresponding Delaunay partition, and rank quadratic forms which are extreme rays for the corresponding -type domain.
Computing the Ehrhart Polynomial of a Convex Lattice Polytope.
A.I. Barvinok (1994)
Discrete & computational geometry
Similarity:
Intrinsic Volumes and Lattice Points of Crosspolytopes.
Ulrich Betke, Martin Henk (1993)
Monatshefte für Mathematik
Similarity: