Holey Hyperbolic Polyforms
Summer Eldridge, Adithya Prabha, Aiden Roger, Cooper Roger, \'Erika Rold\'an, Rosemberg Toal\'a-Enr\'iquez

TL;DR
This paper investigates polyforms in hyperbolic tessellations, focusing on minimizing tiles for a given number of holes, providing bounds, exact cases, and structural conditions.
Contribution
It introduces the function g_{p,q}(h) for minimal tiles in hyperbolic polyforms with holes and establishes bounds, exact values, and structural criteria.
Findings
Established bounds for g_{p,q}(h)
Computed exact values in small cases
Provided structural conditions for polyforms with holes
Abstract
A polyform is a planar figure formed by gluing congruent regular polygons along entire edges. We study polyforms in hyperbolic -tessellations and the extremal problem of minimizing the number of tiles needed to realize exactly holes. Denoting this minimum by , we establish general lower and upper bounds, compute exact values in several small cases, and give a sufficient structural condition for a polyform to have holes and tiles.
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
TopicsGeometric and Algebraic Topology · Mathematical Dynamics and Fractals · Advanced Combinatorial Mathematics
