AbstractA theorem of Scott gives an upper bound for the normalized volume of lattice polygons with exactly i>0 interior lattice points. We will show that the same bound is true for the normalized volume of lattice polytopes of degree 2 even in higher dimensions. In particular, there is only a finite number of quadratic polynomials with fixed leading coefficient being the h∗-polynomial of a lattice polytope
When is the volume of a convex polytope in R^n close to the number of lattice points in the polytope...
In 1980, V. I. Arnold studied the classification problem for convex lattice polygons of given area. ...
AbstractWe present lower bounds for the coefficients of Ehrhart polynomials of convex lattice polyto...
AbstractA theorem of Scott gives an upper bound for the normalized volume of lattice polygons with e...
In this licentiate thesis we study relations among invariants of lattice polytopes, with particular ...
AbstractThe h∗-polynomial of a lattice polytope is the numerator of the generating function of the E...
In this licentiate thesis we study relations among invariants of lattice polytopes, with particular ...
In this PhD thesis we study relations among invariants of lattice polytopes. Particular emphasis is ...
In this PhD thesis we study relations among invariants of lattice polytopes. Particular emphasis is ...
In this PhD thesis we study relations among invariants of lattice polytopes. Particular emphasis is ...
We give a new definition of lattice-face polytopes by removing an unnecessary restriction i...
We give a new definition of lattice-face polytopes by removing an unnecessary restriction i...
AbstractThe h∗-polynomial of a lattice polytope is the numerator of the generating function of the E...
AbstractMinkowski’s second theorem on successive minima gives an upper bound on the volume of a conv...
In 1980, Arnold studied the classification problem for convex lattice polygons of given area. Since ...
When is the volume of a convex polytope in R^n close to the number of lattice points in the polytope...
In 1980, V. I. Arnold studied the classification problem for convex lattice polygons of given area. ...
AbstractWe present lower bounds for the coefficients of Ehrhart polynomials of convex lattice polyto...
AbstractA theorem of Scott gives an upper bound for the normalized volume of lattice polygons with e...
In this licentiate thesis we study relations among invariants of lattice polytopes, with particular ...
AbstractThe h∗-polynomial of a lattice polytope is the numerator of the generating function of the E...
In this licentiate thesis we study relations among invariants of lattice polytopes, with particular ...
In this PhD thesis we study relations among invariants of lattice polytopes. Particular emphasis is ...
In this PhD thesis we study relations among invariants of lattice polytopes. Particular emphasis is ...
In this PhD thesis we study relations among invariants of lattice polytopes. Particular emphasis is ...
We give a new definition of lattice-face polytopes by removing an unnecessary restriction i...
We give a new definition of lattice-face polytopes by removing an unnecessary restriction i...
AbstractThe h∗-polynomial of a lattice polytope is the numerator of the generating function of the E...
AbstractMinkowski’s second theorem on successive minima gives an upper bound on the volume of a conv...
In 1980, Arnold studied the classification problem for convex lattice polygons of given area. Since ...
When is the volume of a convex polytope in R^n close to the number of lattice points in the polytope...
In 1980, V. I. Arnold studied the classification problem for convex lattice polygons of given area. ...
AbstractWe present lower bounds for the coefficients of Ehrhart polynomials of convex lattice polyto...