Helly Numbers of Polyominoes
Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman

TL;DR
This paper investigates the Helly numbers of polyominoes, establishing that only rectangles have Helly number 2, no polyomino has Helly number 3, and polyominoes with other Helly numbers exist.
Contribution
It characterizes the Helly numbers of polyominoes, proving specific values and the existence or non-existence of polyominoes with certain Helly numbers.
Findings
Rectangles are the only polyominoes with Helly number 2.
No polyomino has Helly number 3.
Polyominoes with Helly numbers other than 1 and 3 exist.
Abstract
We define the Helly number of a polyomino as the smallest number such that the -Helly property holds for the family of symmetric and translated copies of on the integer grid. We prove the following: (i) the only polyominoes with Helly number 2 are the rectangles, (ii) there does not exist any polyomino with Helly number 3, (iii) there exist polyominoes of Helly number for any .
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
TopicsGraph Labeling and Dimension Problems · Topological and Geometric Data Analysis · Rings, Modules, and Algebras
