相关论文: On Lattice points and Optimal Packing of Minkowski…
This is the continuation of the author's ArXiv presentation "On packing of Minkowski balls. I". In section 2 we investigate lattice packings of Minkowski balls and domains. By results of the proof of Minkowski conjecture about the critical…
In this paper we prove that the optimal lattice packing of the Minkowski, Davis, and Chebyshev-Cohn balls is realized with respect to the sublattices of index two of the critical lattices of corresponding balls
Lattice coverings in the real plane by Minkowski balls are studied. We exploit the duality of admissible lattices of Minkowski balls and inscribed convex symmetric hexagons of these balls. An explicit moduli space of the areas of these…
We construct direct and inverse systems of Minkowski's balls and domains, direct and inverse systems of their critical lattices and calculate their direct and inverse limits.
We present a natural reverse Minkowski-type inequality for lattices, which gives upper bounds on the number of lattice points in a Euclidean ball in terms of sublattice determinants, and conjecture its optimal form. The conjecture exhibits…
Our object of study is extremal functions which are defined by distance functions of convex bodies. These functions take values in the moduli spaces of algebraic and geometric objects associated with these ${\mathbb Z}$-modules (geometric…
We give a new proof of the Minkowski-Hlawka bound on the existence of dense lattices. The proof is based on an elementary method for constructing dense lattices which is almost effective.
In this paper we are concerned with three lattice problems: the lattice packing problem, the lattice covering problem and the lattice packing-covering problem. One way to find optimal lattices for these problems is to enumerate all finitely…
Given a lattice $\Lambda \subset \mathbb{R}^n$, we consider its Minkowski reduced basis and the solid angle $\Omega$ spanned by the basis vectors. Such a basis satisfies strong near-orthogonality conditions, which allow us to bound from…
Under study are some vector optimization problems over the space of Minkowski balls, i.e., symmetric convex compact subsets in Euclidean space. A typical problem requires to achieve the best result in the presence of conflicting goals;…
We obtain algorithmically effective versions of the dense lattice sphere packings constructed from orders in $\mathbb{Q}$-division rings by the first author. The lattices in question are lifts of suitable codes from prime characteristic to…
Minkowski proved that any $n$-dimensional lattice of unit determinant has a nonzero vector of Euclidean norm at most $\sqrt{n}$; in fact, there are $2^{\Omega(n)}$ such lattice vectors. Lattices whose minimum distances come close to…
Finding the shortest vectors in a lattice is an NP-hard problem, so low-dimensional results also play an essential role in lattice reduction theory. Using Ryskov's result for the admissible centerings and Tammela's result for determining…
We study an optimal stretching problem, which is a variant lattice point problem, for convex domains in $\mathbb{R}^d$ ($d\geq 2$) with smooth boundary of finite type that are symmetric with respect to each coordinate hyperplane/axis. We…
Based on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an efficient algorithm for computing the density of a densest lattice packing of an arbitrary 3-polytope. As an application we calculate densest…
We consider Euclidean lattices spanned by images of algebraic conjugates of an algebraic number under Minkowski embedding, investigating their rank, properties of their automorphism groups and sets of minimal vectors. We are especially…
We consider the question of giving an upper bound for the first nontrivial eigenvalue of the Wentzell-Laplace operator of a domain $\Omega$, involving only geometrical informations. We provide such an upper bound, by generalizing Brock's…
We study an optimal stretching problem for certain convex domain in $\mathbb{R}^d$ ($d\geq 3$) whose boundary has points of vanishing Gaussian curvature. We prove that the optimal domain which contains the most positive (or least…
We address the question of which convex shapes, when packed as densely as possible under certain restrictions, fill the least space and leave the most empty space. In each different dimension and under each different set of restrictions,…
Sphere packings in high dimensions interest mathematicians and physicists and have direct applications in communications theory. Remarkably, no one has been able to provide exponential improvement on a 100-year-old lower bound on the…