It is shown here that every L-polytope of an even unimodular lattice does not generate the lattice. It is given here the corrected formulation of a previous result of the author [3] on relations between extreme L-polytopes and perfect lattices. We prove here the following special case. If the square radius of the circumscribing sphere of an extreme L-polytope P of a lattice L is less than the minimal norm m of L, then the m-extension of P generates a perfect lattice. 1 Introduction Recall some notions of integral lattices and L-polytopes. Details see in [1]. An L-polytope of a lattice L is the convex hull of all lattice points lying on an empty sphere. An empty sphere in a lattice L of dimension n is such a sphere that there is no lattic...
In this licentiate thesis we study relations among invariants of lattice polytopes, with particular ...
In this licentiate thesis we study relations among invariants of lattice polytopes, with particular ...
In 1980, Arnold studied the classification problem for convex lattice polygons of given area. Since ...
AbstractA description of perfect lattices Γ(Un) generated by the L-polytopes Un is given. Γ(Un) is t...
AbstractA description of perfect lattices Γ(Un) generated by the L-polytopes Un is given. Γ(Un) is t...
AbstractIn a recent paper, Karpenkov has classified the lattice polytopes (that is, with vertices in...
AbstractThis paper expresses the minimal possible lp-perimeter of a convex lattice polygon with resp...
A polytope P of 3-space, which meets a given lattice L only in its vertices, is called L-elementary....
AbstractVoronoi defines a partition of the cone of positive semidefinite n -ary formsPn into L -type...
A lattice Delaunay polytope is perfect if its Delaunay sphere is its only circumscribed ellipsoid. A...
In each dimension d there is a constant woo(d) [épsilon] N such that for every n [épsilon] N all but...
AbstractThe diameter of a convex set C is the length of the longest segment in C, and the local diam...
Abstract. We show by a construction that there are at least exp {cV (d−1)/(d+1) } convex lattice pol...
We show that a specific even unimodular lattice of dimension 80, first investigated by Schulze-Pillo...
We investigate perfect codes in Zn in the ℓp metric. Upper bounds for the packing radius r of a line...
In this licentiate thesis we study relations among invariants of lattice polytopes, with particular ...
In this licentiate thesis we study relations among invariants of lattice polytopes, with particular ...
In 1980, Arnold studied the classification problem for convex lattice polygons of given area. Since ...
AbstractA description of perfect lattices Γ(Un) generated by the L-polytopes Un is given. Γ(Un) is t...
AbstractA description of perfect lattices Γ(Un) generated by the L-polytopes Un is given. Γ(Un) is t...
AbstractIn a recent paper, Karpenkov has classified the lattice polytopes (that is, with vertices in...
AbstractThis paper expresses the minimal possible lp-perimeter of a convex lattice polygon with resp...
A polytope P of 3-space, which meets a given lattice L only in its vertices, is called L-elementary....
AbstractVoronoi defines a partition of the cone of positive semidefinite n -ary formsPn into L -type...
A lattice Delaunay polytope is perfect if its Delaunay sphere is its only circumscribed ellipsoid. A...
In each dimension d there is a constant woo(d) [épsilon] N such that for every n [épsilon] N all but...
AbstractThe diameter of a convex set C is the length of the longest segment in C, and the local diam...
Abstract. We show by a construction that there are at least exp {cV (d−1)/(d+1) } convex lattice pol...
We show that a specific even unimodular lattice of dimension 80, first investigated by Schulze-Pillo...
We investigate perfect codes in Zn in the ℓp metric. Upper bounds for the packing radius r of a line...
In this licentiate thesis we study relations among invariants of lattice polytopes, with particular ...
In this licentiate thesis we study relations among invariants of lattice polytopes, with particular ...
In 1980, Arnold studied the classification problem for convex lattice polygons of given area. Since ...