On $κ$-covering minima

Fei Xue

Home/Archive/arXiv

arXiv · 2610.39034

On $κ$-covering minima

Fei Xue

View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce $κ$-covering minima by requiring the permutation simplices of one independent lattice frame to fit into translates of a common dilate of a convex body. We prove a lower bound for their normalized product, with coefficient $(n+1)/2^n$ for centrally symmetric bodies and an explicit dependence on Minkowski asymmetry in general. On Euclidean balls, the supremum over full-rank lattices of the ratio of the resulting fitting radius to the covering radius has order $\sqrt n$. We also establish basic comparisons with classical lattice minima and bounds under products, projections, Minkowski addition, and free direct sums. We extend the definition by allowing projected periodic lattice triangulations. These extended minima agree with the classical covering minima on ellipsoids.

Explore related subjects

math.MG

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Fei Xue. 2026-10-28. On $κ$-covering minima. https://arxiv.org/abs/2610.39034

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On two counterexamples in the geometry of numbers

We give counterexamples to two optimization problems in dimensions eight and nine. 1. The Cartesian-product problem posed by Cassels for critical determinants and later formulated by Zong for lattice packings and for packings allowing translations but not rotations: whether the corresponding product inequalities are always equalities. The counterexample also disproves the natural product formula for unrestricted congruent packings. 2. A question raised by Sarnak and formulated as a conjecture in Chiu: whether, among unit-volume flat tori, height is minimized by a lattice maximizing the length of its shortest nonzero vector.

math.MG↗

arXiv2026

On a Brunn-Minkowski principle for first-order information functionals

In this work we present the following general principle: every positive homogeneous functional on an abstract convex cone satisfying a suitable Brunn-Minkowski inequality gives rise to an information functional -defined as the quotient of the functional by its relative surface area- that satisfies a linear Brunn-Minkowski inequality. We also establish the dual counterpart of this principle for functionals satisfying an analogous convexity property, yielding reverse linear Brunn-Minkowski inequalities for the associated information functionals. Furthermore, we show that homogeneity is necessary within this principle by providing a counterexample to the expected result for the information functional associated to the standard Gaussian measure. As applications, we recover, via an alternative first-order argument, a classical result by Giannopoulos, Hartzoulaki and Paouris (2002) for the ratio of two consecutive quermassintegrals, together with a characterization of the equality case. The same argument extends to the setting of mixed discriminants of symmetric positive definite matrices. Finally, our approach yields new extensions of the Brunn-Minkowski inequality of Dembo, Cover and Thomas, for the classical information functional, both to the $L_p$ setting ($p \geq 1$), where the relative surface area is expressed in terms of Lutwak's first $L_p$ quermassintegral, and to the measure-theoretic framework, for measures with homogeneous densities satisfying some concavity. Moreover, we prove that our principle applies also in the context of the Blaschke addition, both in the volume and in the (mixed) affine surface area cases, obtaining new inequalities as an application of it.

math.MG↗

arXiv2026

Borsuk number in four dimensions is at most seven

We prove that every bounded set of diameter one in four-dimensional Euclidean space can be covered by seven balls of diameter strictly smaller than $0.9999$. In particular, the Borsuk number satisfies $b_4\le7$. The proof combines geometric arguments based on contact points of the circumball with an exact finite computation. For small and large circumradius, the covering centres are constructed analytically. In the remaining range, a suitable triangle of contact points reduces the problem to a four-parameter family of ball polytopes. The parameter cube is subdivided into 23494 boxes. For each parameter box, candidate centres are found by nonlinear optimization, and the resulting covering is verified using exact rational interval arithmetic and paraboloid lifting.

math.MG↗