Asymptotic hollowness of lattice simplices
David Handelman

TL;DR
This paper studies the asymptotic behavior of lattice simplices defined by certain integer tuples, characterizing when these simplices are hollow and identifying all such cases in four dimensions.
Contribution
It provides a complete characterization of nontrivial asymptotically hollow tuples, including an effective criterion and explicit classification in four dimensions.
Findings
Nontrivial asymptotically hollow tuples are characterized by modular inequalities.
Existence of a computable constant C determining the hollow property for large N.
Complete classification of nontrivial asymptotically hollow triples in four dimensions.
Abstract
An -tuple consisting of positive integers is said to be asymptotically hollow if there exist infinitely many positive integers such that the convex hull, , in -dimensional Euclidean space of is hollow (has no lattice points in its interior), where run over all but the last standard basis elements, and is the row . The tuple is trivial if . Nontrivial asymptotically hollow tuples are characterized in terms of modular inequalities, and turn out to be rare. We show that for a tuple , there exists an effectively computable constant (depending on ) such that if for some , is (not) hollow, then for all , is (not) hollow (respectively). When , the nontrivial asymptotically hollow…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBenford’s Law and Fraud Detection · Computability, Logic, AI Algorithms · semigroups and automata theory
