On Helly number for crystals and cut-and-project sets
Alexey Garber

TL;DR
This paper establishes the existence of Helly numbers for crystals and cut-and-project sets with convex windows, providing bounds for two-dimensional crystals composed of multiple lattice copies.
Contribution
It introduces the concept of Helly numbers for these geometric structures and derives an upper bound for two-dimensional crystals with multiple lattice copies.
Findings
Helly numbers exist for crystals and cut-and-project sets with convex windows.
For 2D crystals with k lattice copies, the Helly number is at most k+6.
The paper provides new bounds and existence results for Helly numbers in these settings.
Abstract
We prove existence of Helly numbers for crystals and for cut-and-project sets with convex windows. Also we show that for a two-dimensional crystal consisting of copies of a single lattice the Helly number does not exceed .
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
Topicssemigroups and automata theory · Computability, Logic, AI Algorithms · Benford’s Law and Fraud Detection
