Primitive point packing

DOI10.1112/MTK.12149MaRDI QIDQ6074967zbMATH OpenOpenAlexFDO

Authors Antoine Deza, Lionel Pournin

Publication date 20 September 2023

Published in Mathematika (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2006.14228

zbMATH Keywords

packingpolytopes

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07)

Abstract: A point in the $d$-dimensional integer lattice $mathbb{Z}^d$ is primitive when its coordinates are relatively prime. Two primitive points are multiples of one another when they are opposite, and for this reason, we consider half of the primitive points within the lattice, the ones whose first non-zero coordinate is positive. We solve the packing problem that asks for the largest possible number of such points whose absolute values of any given coordinate sum to at most a fixed integer $k$. We present several consequences of this result at the intersection of geometry, number theory, and combinatorics. In particular, we obtain an explicit expression for the largest possible diameter of a lattice zonotope contained in the hypercube $[0,k{]}^d$ and, conjecturally of any lattice polytope in that hypercube.

Recommendations

• scientific article; zbMATH DE number 5593210
• Packing-constrained point coverings
• Packing points into a unit cube in higher space
• scientific article; zbMATH DE number 3955884
• scientific article; zbMATH DE number 6470126
• Packing plane spanning trees into a point set
• Packing minima and lattice points in convex bodies
• Primitive zonotopes
• scientific article; zbMATH DE number 3988134
• scientific article; zbMATH DE number 4030375

Cites work

• A counterexample to the Hirsch conjecture
• A Lower Bound for the Volume of Strictly Convex Bodies with many Boundary Lattice Points
• A quasi-polynomial bound for the diameter\\of graphs of polyhedra
• An asymptotically improved upper bound on the diameter of polyhedra
• Classifying smooth lattice polytopes via toric fibrations
• Computing the Continuous Discretely
• Coprime Ehrhart Theory and Counting Free Segments
• Counting problems relating to a theorem of Dirichlet
• Finitely many smooth \(d\)-polytopes with \(n\) lattice points
• Hodge theory for combinatorial geometries
• scientific article; zbMATH DE number 192947 (Why is no real title available?)
• scientific article; zbMATH DE number 3032896 (Why is no real title available?)
• Lattice points in simple polytopes
• Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs
• On the diameter of lattice polytopes
• On the probability that k positive integers are relatively prime
• Primitive zonotopes
• Projecting lattice polytopes without interior lattice points
• Sur un probl?me de g?om?trie diophantienne lin?aire. I. Poly?dres et r?seaux.
• The \(d\)-step conjecture for polyhedra of dimension \(d<6\)
• The diameter of lattice zonotopes
• The Hirsch conjecture is true for (0,1)-polytopes
• The number of faces of a simplicial convex polytope
• Toric varieties, lattice points and Dedekind sums

Cited in

(1)

• The complexity of geometric scaling

This page was built for publication: Primitive point packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074967)