REVIEW 1 major objections 1 minor 22 references
Unboundedness of the Heesch Number for Hyperbolic Convex Monotiles
T0 review · 1 major / 1 minor · reviewed 2026-05-21 · grok-4.3
Pith's one-line read Convex monotiles in the hyperbolic plane can surround themselves any number of times without tiling the entire plane.
desk verdict The paper claims to resolve the Heesch problem for homogeneous tilings in the hyperbolic plane with a corollary for convex monotiles and adds first examples of weakly aperiodic convex monotiles from duals. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
Homogeneous (semi-regular) tilings of the hyperbolic plane, together with their duals, which are used to build families of convex monotiles with increasing finite surround counts.
What would settle it
An explicit convex monotile in the hyperbolic plane together with a proof that no arrangement of congruent copies can surround it more than a fixed finite number of times would falsify the unboundedness claim.
Extended reading notes
Core claim
We construct homogeneous tilings in the hyperbolic plane in which a tile admits arbitrarily large finite numbers of concentric surrounds by congruent copies without admitting a full tiling of the plane. This shows the Heesch number is unbounded for homogeneous tilings. The same unboundedness then follows for convex monotiles by the stated corollary. Duals of the homogeneous tilings also yield the first examples of weakly aperiodic convex monotiles.
Load-bearing premise
The constructions and properties shown for homogeneous tilings carry over directly to convex monotiles by the corollary without needing separate checks that hyperbolic geometry or convexity imposes a uniform bound on surround counts.
Editorial extensions
If this is right
- For any positive integer N there exist convex monotiles in the hyperbolic plane that admit at least N concentric surrounds without tiling the plane.
- The Heesch problem is settled negatively for the class of homogeneous tilings and, by corollary, for convex monotiles.
- Duals of homogeneous tilings supply the first known weakly aperiodic convex monotiles.
- Any search for convex monotiles with bounded Heesch number in hyperbolic geometry must exclude or modify the homogeneous case.
Reading between the lines
- Similar constructions might be adapted to produce convex monotiles with controlled but large Heesch numbers in other non-Euclidean settings.
- The existence of weakly aperiodic convex monotiles in hyperbolic geometry raises the question of whether stronger aperiodicity results are possible with the same dual technique.
- The result suggests that bounded-Heesch-number problems in hyperbolic geometry are likely to require tiles whose vertex figures or edge lengths vary in ways forbidden by homogeneity.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper claims to resolve the Heesch problem for homogeneous (semi-regular) tilings in the hyperbolic plane by constructing families with arbitrarily large Heesch numbers, asserts this as a corollary for convex monotiles, and additionally exhibits the first known weakly aperiodic convex monotiles obtained as duals of homogeneous tilings.
Significance. If the constructions are valid, the result would resolve an open question on the Heesch number in hyperbolic geometry for these tile classes and supply new examples of weakly aperiodic monotiles; the explicit constructions for the homogeneous case constitute a concrete strength.
major comments (1)
- [Corollary after §3] Corollary following §3: the transfer of unbounded Heesch numbers from homogeneous tilings to convex monotiles is stated directly but supplies no separate verification that convexity and the hyperbolic metric do not introduce angle-deficit or curvature constraints capable of bounding the surround count; a concrete check (e.g., angle-sum calculation or explicit layer construction under convexity) is required for the corollary to be load-bearing.
minor comments (1)
- [final section] Notation for the dual construction in the final section could be clarified by adding a short diagram labeling the correspondence between homogeneous tiles and their dual monotiles.
Simulated Author's Rebuttal
We thank the referee for their thorough reading and for identifying a point where the presentation of the corollary could be strengthened. We address the major comment below and will incorporate the requested verification in the revised manuscript.
read point-by-point responses
-
Referee: [Corollary after §3] Corollary following §3: the transfer of unbounded Heesch numbers from homogeneous tilings to convex monotiles is stated directly but supplies no separate verification that convexity and the hyperbolic metric do not introduce angle-deficit or curvature constraints capable of bounding the surround count; a concrete check (e.g., angle-sum calculation or explicit layer construction under convexity) is required for the corollary to be load-bearing.
Authors: The homogeneous tilings in our constructions are formed by regular convex polygons meeting at vertices in the hyperbolic plane, so the prototiles are already convex. The explicit families we construct demonstrate that the angle deficits at vertices allow the number of surrounding layers to grow without bound while maintaining convexity and avoiding gaps or overlaps. To address the referee's concern directly, we will add a dedicated paragraph (or short subsection) after the corollary that performs an explicit angle-sum verification for one representative family: we compute the hyperbolic angle sum for successive layers around a central tile and show that the deficit permits arbitrarily large finite Heesch numbers without curvature imposing an upper bound. This will include a concrete numerical example confirming that convexity does not cap the surround count. revision: yes
Circularity Check
Derivation chain self-contained; no circular reductions identified
full rationale
The paper claims a resolution of the Heesch problem via new constructions for homogeneous tilings, followed by a corollary for convex monotiles. No quoted steps reduce a claimed prediction or first-principles result to its own inputs by definition, fitted parameters, or load-bearing self-citations. The abstract and described structure rest on original constructions rather than renaming known results or smuggling ansatzes. This is the normal case of an independent derivation against external benchmarks.
Assumptions & free parameters
assumptions (1)
- standard math Standard axioms and properties of hyperbolic plane geometry and monohedral tilings
Cite this review
Pith. "Pith review of Unboundedness of the Heesch Number for Hyperbolic Convex Monotiles." pith.science (2026). https://pith.science/paper/SPOQAKQG
@misc{pith2026260327827,
author = {Pith},
title = {Pith review of: Unboundedness of the Heesch Number for Hyperbolic Convex Monotiles},
year = {2026},
howpublished = {\url{https://pith.science/paper/SPOQAKQG}},
note = {Machine review of arXiv:2603.27827}
}
read the original abstract
We provide a resolution of the Heesch problem for homogeneous (also known as semi-regular) tilings, and as a corollary, for tilings by convex monotiles in the hyperbolic plane. We also provide the first known example of weakly aperiodic convex monotiles arising from the dual of homogeneous tilings.
Figures
Lean theorems connected to this paper
-
IndisputableMonolith/Foundation/AlexanderDuality.leanalexander_duality_circle_linking unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
Theorem 1.1. For any given positive integer n, there exists a cyclic tuple k_n with Heesch number n.
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
Reference graph
Works this paper leans on
-
[1]
138, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019, pp
Nathalie Aubrun, Sebastián Barbieri, and Etienne Moutot,The Domino Problem is Unde- cidable on Surface Groups, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) (Dagstuhl, Germany), Leibniz International Proceedings in Informatics (LIPIcs), vol. 138, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019, pp. 46:1–46:14
work page 2019
-
[2]
Bojan Bašić,The Heesch number for multiple prototiles is unbounded, C. R. Math. Acad. Sci. Paris353(2015), no. 8, 665–669. MR 3367631
work page 2015
-
[3]
thesis, Harvard University, 1964
Robert Berger,The undecidability of the domino problem, Ph.d. thesis, Harvard University, 1964
work page 1964
-
[4]
Robert Berger,The undecidability of the domino problem, Mem. Amer. Math. Soc. No.66 (1966), 72
work page 1966
-
[5]
Eduardo Brandani da Silva and Giovana Higinio de Souza,Uniform tilings, border automata and orbifolds of the hyperbolic plane, International Journal of Geometry11(2022), no. 1, 138–187
work page 2022
-
[6]
Basudeb Datta and Subhojoy Gupta,Semi-regular tilings of the hyperbolic plane, Discrete Comput. Geom.65(2021), no. 2, 531–553. MR 4212977
work page 2021
-
[7]
Chaim Goodman Strauss,A strongly aperiodic set of tiles in the hyperbolic plane, Invent. Math.159(2005), no. 1, 119–132. 9
work page 2005
-
[8]
Branko Grünbaum and G. C. Shephard,Incidence symbols and their applications, Relations between combinatorics and other parts of mathematics (Proc. Sympos. Pure Math., Ohio State Univ., Columbus, Ohio, 1978), Proc. Sympos. Pure Math., XXXIV, Amer. Math. Soc., Providence, R.I., 1979, pp. 199–244
work page 1978
Show all 22 references
-
[9]
,Tilings and patterns, W. H. Freeman and Company, New York, 1987
1987
-
[10]
44, 4010–4016
Emmanuel Jeandel,The periodic domino problem revisited, Theoretical Computer Science 411(2010), no. 44, 4010–4016
2010
-
[11]
44, 4010–4016
,The periodic domino problem revisited, Theoretical Computer Science411(2010), no. 44, 4010–4016
2010
-
[12]
Kari,The tiling problem revisited, Lect
J. Kari,The tiling problem revisited, Lect. Notes Comput. Sci.4664(2007), 72–79
2007
-
[13]
7, 111911, 7
Arun Maiti,Quasi-vertex-transitive maps on the plane, Discrete Math.343(2020), no. 7, 111911, 7. MR 4079360
2020
-
[14]
Arun Maiti,Pseudo-homogeneous tiling of the hyperbolic plane, arXiv e-prints (2023), arXiv:2302.05661
2023
-
[15]
1, 29–84
Maurice Margenstern,The domino problem of the hyperbolic plane is undecidable, Theoret- ical Computer Science407(2008), no. 1, 29–84
2008
-
[16]
Maurice Margenstern,The periodic domino problem is undecidable in the hyperbolic plane, Reachability Problems (Berlin, Heidelberg) (Olivier Bournez and Igor Potapov, eds.), Springer Berlin Heidelberg, 2009, pp. 154–165
2009
-
[17]
G. A. Margulis and S. Mozes,Aperiodic tilings of the hyperbolic plane by convex polygons, Israel J. Math.107(1998), 319–325
1998
-
[18]
Michael Rao,Exhaustive search of convex pentagons which tile the plane, arXiv e-prints (2017), arXiv:1708.00274
2017 arXiv
-
[19]
Renault,The uniform locally finite tilings of the plane, Journal of Combinatorial Theory, Series B98(2008), no
D. Renault,The uniform locally finite tilings of the plane, Journal of Combinatorial Theory, Series B98(2008), no. 4, 651–671
2008
-
[20]
Tarasov,On the heesch number for the hyperbolic plane, Math Notes88(2010), 97–102
A.S. Tarasov,On the heesch number for the hyperbolic plane, Math Notes88(2010), 97–102
2010
-
[21]
com, 2021
Marek ˘Ctrnáct,More about hybrid hyperbolic tilings,https://www.reddit.com/r/math/ comments/pbvj5l/more_about_hybrid_hyperbolic_tilings/?utm_source=chatgpt. com, 2021
2021
-
[22]
HaoWang,Proving theorems by pattern recognition — ii, TheBellSystemTechnicalJournal 40(1961), no. 1, 1–41. 10
1961
Reviewed May 21, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.