中文
相关论文

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

200 篇论文

The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping unit balls which cover as much space as possible. We define a generalized version of the problem, where we allow each ball a limited amount of…

计算几何 · 计算机科学 2014-01-03 Mabel Iglesias-Ham , Michael Kerber , Caroline Uhler

In 1978, Makai Jr. established a remarkable connection between the volume-product of a convex body, its maximal lattice packing density and the minimal density of a lattice arrangement of its polar body intersecting every affine hyperplane.…

度量几何 · 数学 2016-05-03 Bernardo González Merino , Matthias Henze

The main purpose of this note is to prove an upper bound on the number of lattice points of a centrally symmetric convex body in terms of the successive minima of the body. This bound improves on former bounds and narrows the gap towards a…

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

The maximal index of a Euclidean lattice L of dimension n is the maximal index of the sub-lattices of L spanned by n independent minimal vectors of L. In this paper, we prove that a perfect lattice of maximal index two not provided by a…

数论 · 数学 2008-06-05 Anne-Marie Bergé

Using the notion of Dubiner distance, we give an elementary proof of the fact that good covering point configurations on the 2-sphere are optimal polynomial meshes. From these we extract Caratheodory-Tchakaloff (CATCH) submeshes for…

数值分析 · 数学 2016-12-16 Paul Leopardi , Alvise Sommariva , Marco Vianello

Dense hard-particle packings are intimately related to the structure of low-temperature phases of matter and are useful models of heterogeneous materials and granular media. Most studies of the densest packings in three dimensions have…

软凝聚态物质 · 物理学 2015-05-13 Yang Jiao , Frank Stillinger , Sal Torquato

The smallest three hyperbolic compact arithmetic 5-orbifolds can be derived from two compact Coxeter polytops which are combinatorially simplicial prisms (or complete orthoschemes of degree $d=1$) in the five dimensional hyperbolic space…

度量几何 · 数学 2013-06-19 Jenő Szirmai

In this paper we prove a generalization of famous Larchr's theorem concerning good lattice points.

数论 · 数学 2012-03-15 Dmitry Ushanov

We describe algorithms which address two classical problems in lattice geometry: the lattice covering and the simultaneous lattice packing-covering problem. Theoretically our algorithms solve the two problems in any fixed dimension d in the…

度量几何 · 数学 2007-05-23 Achill Schuermann , Frank Vallentin

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…

度量几何 · 数学 2017-03-02 Danny Nguyen

We investigate the average number of lattice points within a ball for the $n$th cyclotomic number field, where the lattice is chosen at random from the set of unit determinant ideal lattices of the field. We show that this average is nearly…

数论 · 数学 2025-12-12 Nihar Gargava , Maryna Viazovska

Consider the integer best approximations of a linear form in $n\ge 2$ real variables. While it is well-known that any tail of this sequence always spans a lattice is sharp for any $n\ge 2$. In this paper, we determine the exact Hausdorff…

数论 · 数学 2025-09-17 Johannes Schleischitz

We deal with lattices that are generated by the Vandermonde matrices associated to the roots of Chebyshev-polynomials. If the dimension $d$ of the lattice is a power of two, i.e. $d=2^m, m \in \mathbb{N}$, the resulting lattice is an…

数值分析 · 数学 2016-07-01 Christopher Kacwin , Jens Oettershagen , Tino Ullrich

In this work, we discuss completeness for the lattice orders of first and second order stochastic dominance. The main results state that, both, first and second order stochastic dominance induce Dedekind super complete lattices,…

概率论 · 数学 2020-07-01 Max Nendel

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…

数论 · 数学 2025-11-05 Lenny Fukshansky , Evelyne Knight

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…

信息论 · 计算机科学 2021-09-13 Ethan Mook , Chris Peikert

We prove explicit stability estimates for the sphere packing problem in dimensions 8 and 24, showing that, in the lattice case, if a lattice is $\sim \varepsilon$ close to satisfying the optimal density, then it is, in a suitable sense,…

度量几何 · 数学 2024-01-11 Károly J. Böröczky , Danylo Radchenko , João P. G. Ramos

We show that all balanced d-lattices must be complemented, answering a question of Chajda and Eigenthaler. (A bounded lattice is balanced if any two congruences agree on their 1-classes iff they agree on their 0-classes.) Our main tool is…

环与代数 · 数学 2007-05-23 Martin Goldstern , Miroslav Ploscica

The goal of this paper is to deepen the study of multiplicative lattices in the sense of Facchini, Finocchiaro and Janelidze. We provide a sort of Prime Ideal Principle that guarantees that maximal implies prime in a variety of cases (among…

环与代数 · 数学 2022-07-12 Alberto Facchini , Carmelo Antonio Finocchiaro

We prove that every finite lattice L can be embedded in a three-generated finite lattice K. We also prove that every algebraic lattice with accessible cardinality is a complete sublattice of an appropriate algebraic lattice K such that K is…

环与代数 · 数学 2015-12-15 Gábor Czédli