中文
相关论文

相关论文: On packing of Minkowski balls. I

200 篇论文

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…

数论 · 数学 2023-03-28 Nikolaj Glazunov

We investigate lattice packings of Minkowski's balls and domains, as well as the distribution of lattice points on Minkowski's curves which are boundaries of Minkowski's balls. By results of the proof of Minkowski's conjecture about the…

数论 · 数学 2023-05-26 Nikolaj Glazunov

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…

数论 · 数学 2023-12-07 Nikolaj Glazunov

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.

数论 · 数学 2007-05-23 Roland Bacher

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…

度量几何 · 数学 2016-06-23 Daniel Dadush , Oded Regev

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…

度量几何 · 数学 2008-09-26 Achill Schuermann , Frank Vallentin

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…

数论 · 数学 2022-04-12 Nihar Gargava , Vlad Serban

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…

度量几何 · 数学 2007-05-23 Ulrich Betke , Martin Henk

This paper introduces a technique for proving the local optimality of packing configurations. Applying this technique to a general convex polygon, we prove that the construction of the optimal double lattice packing by Kuperberg and…

度量几何 · 数学 2017-08-11 Yoav Kallus , Wöden Kusner

Empirical constructions having maximal contact numbers of unit balls as putative best ones are presented for 20-27 balls.

度量几何 · 数学 2016-03-18 Istvan Szalkai

The aim of this paper is to study lattice-like coverings with congruent translation balls and the packings and coverings with a type of translation cylinders in Sol space related to the fundamental lattices. We introduce the notions of the…

度量几何 · 数学 2025-12-04 Judit Sajtos , Jenő Szirmai

We find tight estimates for the minimum number of proper subspaces needed to cover all lattice points in an n-dimensional convex body symmetric about the origin. We also find the order of magnitude of the number of (n-1)-dimensional…

数论 · 数学 2024-11-18 Imre Bárány , Gergely Harcos , János Pach , Gábor Tardos

Building on Viazovska's recent solution of the sphere packing problem in eight dimensions, we prove that the Leech lattice is the densest packing of congruent spheres in twenty-four dimensions and that it is the unique optimal periodic…

The mean-centered cuboidal (or m.c.c.) lattice is known to be the optimal packing and covering among all isodual three-dimensional lattices. In this note we show that it is also the best quantizer. It thus joins the isodual lattices Z, A_2…

数论 · 数学 2014-09-17 J. H. Conway , N. J. A. Sloane

We characterize the finite intervals of the Muchnik lattice by proving that they are a certain proper subclass of the finite distributive lattices.

逻辑 · 数学 2007-05-23 Sebastiaan A. Terwijn

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.

度量几何 · 数学 2023-08-09 Nikolaj Glazunov

We consider two constructions of an envelope for a finite locally distributive strong upper semilattice. The first is based on Birkhoff's representation of finite distributive lattices and the second on valuations on lattices. We show that…

组合数学 · 数学 2009-02-03 Colin Bailey , Joseph Oliveira

In this note we give a simple proof of the classical fact that the hexagonal lattice gives the highest density circle packing among all lattices in $R^2$. With the benefit of hindsight, we show that the problem can be restricted to the…

数论 · 数学 2010-11-29 Lenny Fukshansky

In this paper we describe the intersection between the balls of maximal symplectic packings of $\P^2$. This analysis shows the existence of singular points for maximal packings of $\P^2$ by more than three equal balls. It also yields a…

辛几何 · 数学 2007-05-23 Emmanuel Opshtein

Let $\Lb$ be a lattice in an $n$-dimensional Euclidean space $E$ and let $\Lb'$ be a Minkowskian sublattice of $\Lb$, that is, a sublattice having a basis made of representatives for the Minkowski successive minima of $\Lb$. We consider the…

数论 · 数学 2012-02-13 Jacques Martinet
‹ 上一页 1 2 3 10 下一页 ›