Pith. sign in

REVIEW 4 major objections 5 minor 5 references

Horofunctions of infinite Sierpinski polygon graphs

T0 review · 4 major / 5 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read The horofunction boundary of an infinite Sierpinski polygon graph with an eventually constant defining sequence has exactly two Busemann points and countably many non-Busemann points.

desk verdict A real extension of the Sierpinski carpet program, with a clean isomorphism theorem, but the horofunction count rests on hole geometry the paper explicitly leaves informal. read the letter →

arxiv 2507.23681 v1 pith:6USKF7B4 submitted 2025-07-31 math.CO math.MG

Daniele D'Angeli , Francesco Matucci , Davide Perego , Emanuele Rodaro This is my paper · ORCID
classification math.COmath.MG MSC 05C1205C6320F65
keywords horofunctionboundaryBusemannpointsSierpinskipolygongraphsGromov–Hausdorffconvergenceself-similarcutweakly-geodesicraysdihedralgroup
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper studies infinite Sierpinski polygon graphs, the limiting graphs obtained by recursively gluing $r$ copies of a polygon graph, for any $r$ not divisible by 4. It proves that two such limit graphs are isomorphic exactly when their defining infinite sequences agree up to a dihedral symmetry of the $r$-polygon and a finite prefix. It then analyzes the horofunction boundary, a standard compactification formed by limiting distance functions to points, and shows that for an eventually constant defining sequence the boundary contains exactly two Busemann points (limits of geodesic rays) and countably many non-Busemann points. The result generalizes earlier work on Sierpinski carpet and triangle graphs, where a similar dichotomy between Busemann and non-Busemann points was observed.

What carries the argument

The argument is carried by the self-similar geometry of holes and cut points in $\Gamma^{(r)}_k$. The recursive gluing rule identifies vertices at offsets $f(r) = \min\{i : 4i > r\}$ and $\tilde{f}(r) = 2f(r)$, producing a central 'hole' at each scale; a $k$-hole is the subgraph surrounding that hole, and the antipodal point $p_m$ of the $m$-hole with respect to the base vertex $\xi$ is the vertex of the opposite copy of $\Gamma_m$ that satisfies $d(b_m, p_m) = d(\bar{b}_m, p_m)$, where $b_m$ and $\bar{b}_m$ are the two gluing vertices of the copy containing $\xi$. This equidistance identity, together with the cut-point fact that any geodesic joining the two antipodal copies of $\Gamma_m$ must pass through $b_m$ or $\bar{b}_m$, is what makes the sequences $\{p_m\}$, $\{b_m\}$, and $\{\bar{b}_m\}$ weakly-geodesic. The paper also uses the characterization of horofunctions as pointwise limits of weakly-geodesic rays (Theorem 3.3) to turn these geometric sequences into boundary points.

What would settle it

For a concrete case such as $r=6$ and $\xi = 4^\infty$, compute at every level $m$ the distances $d(b_m, p_m)$, $d(\bar{b}_m, p_m)$, and $d(b_m,\bar{b}_m)$ in $\Gamma^{(6)}_m$; if the asserted identity $d(b_m, p_m) = d(\bar{b}_m, p_m)$ or the cut-point property fails at any $m$, the weakly-geodesic computation breaks and the count in Theorem 3.15 would change. A complementary check is to enumerate all horofunctions of this graph by the weakly-geodesic ray characterization and confirm that exactly the two described Busemann points appear.

Watch

Extended reading notes

Core claim

The paper claims that the pointed Gromov–Hausdorff limits $\Gamma^{(r)}_\xi$ of the recursive Sierpinski polygon graphs $\Gamma^{(r)}_k$, taken along an infinite sequence $\xi$ over $r$ letters with $r$ not a multiple of 4, are classified up to isomorphism by the cofinality class of $\xi$ under the action of the dihedral group $D_r$ (Theorem 2.4). For the boundary analysis, when $\xi = w j^\infty$ is eventually constant, the horofunction boundary $\partial_h \Gamma^{(r)}_\xi$ contains exactly two Busemann points, realised by the two symmetric geodesic rays that run along the sequences of gluing vertices $\{b_m\}$ and $\{\bar{b}_m\}$, and it contains countably many non-Busemann points, realised by the antipodal sequence $\{p_m\}$ of points on the central holes together with its integer shifts (Theorem 3.15). The non-Busemann points are limits of weakly-geodesic rays but not of almost-geodesic rays, so they sit strictly outside the Busemann subset.

Load-bearing premise

The equidistance and cut-point properties of the antipodal point $p_m$ for the $m$-hole are stated informally and rely on an omitted formal definition of a $k$-hole; if the formal definition produced different distances, the count of non-Busemann points in Theorem 3.15 would change.

Editorial extensions

If this is right

  • If Theorem 2.4 is correct, deciding whether two Sierpinski polygon limit graphs are isomorphic reduces to checking whether one defining sequence can be transformed into the other by a dihedral symmetry followed by a change on finitely many initial letters.
  • If Theorem 3.15 is correct, then for every eventually constant sequence the geodesic-ray part of the horofunction boundary is completely understood: there are exactly two Busemann points, one for each of the two symmetric gluing-vertex sequences.
  • The antipodal sequences and their shifts provide an explicit, enumerable family of non-Busemann horofunctions, so the non-Busemann part of the boundary is at least countably infinite in these graphs.
  • The same cut-point argument shows that any geodesic ray from $\xi$ must eventually pass through the sequence $\{b_m\}$ or through $\{\bar{b}_m\}$, so the two Busemann points constructed are the only possible ones.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The theorem is stated for eventually constant sequences, but the machinery of antipodal points is built for the 'grows away from $j$' condition; a natural next step, already anticipated by the paper's Conjecture 3.16, is that for sequences containing other letters infinitely often the boundary should still have exactly two Busemann points, with the number and type of non-Busemann families governed
  • The isomorphism classification identifies limit graphs up to cofinality under $D_r$; because the paper explicitly links the construction to Schreier graphs of self-similar groups, the horofunction boundary described here may coincide with the boundary of the corresponding Schreier graph, which would transfer the counting result to a group-theoretic setting.
  • The paper leaves open whether the word 'contains' in Theorem 3.15 can be strengthened to 'consists of'—that is, whether the two Busemann points and the constructed countable family exhaust the entire horofunction boundary; a positive answer would make the boundary countable, while a negative one would reveal additional non-Busemann structure.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The paper constructs infinite Sierpinski polygon graphs Γξ^(r) for r not divisible by 4, defined as strong Gromov–Hausdorff limits of recursively built finite graphs indexed by an infinite sequence ξ over r letters. It proves an isomorphism classification (Theorem 2.4): Γξ and Γη are isomorphic if and only if η is cofinal with σ(ξ) for some σ in the dihedral group D_r. The main new result (Theorem 3.15) claims that for eventually constant ξ = w j^∞, the horofunction boundary contains exactly two Busemann points and countably many non-Busemann points; the proof uses holes, cut points, antipodal sequences, and weakly-geodesic rays. A conjecture extends the description to general sequences.

Significance. If Theorem 3.15 is correct, the paper gives the first complete description of the horofunction boundary for this family of infinite self-similar graphs, complementing the earlier Sierpinski carpet work of D'Angeli and Donno. The isomorphism classification, Theorem 2.4, is clean, parameter-free, and appears self-contained, and the strong Gromov–Hausdorff setup is a useful framework for the later boundary analysis. The paper contains no machine-checked proofs, and its central boundary theorem rests on informally defined k-hole geometry that the authors explicitly leave unformalized; this is a genuine load-bearing gap. The use of [DD16, Proposition 4.2] for the non-Busemann criterion is legitimate external support rather than circular reasoning, since the main theorem does not reduce to an input parameter of the paper.

major comments (4)
  1. [Definitions 3.6–3.7 and Theorem 3.15] Definition 3.6 explicitly omits the formal definition of a k-hole, stating that it 'is rather technical and not relevant for our purposes.' Definition 3.7 then defines the antipodal point p_m by the equality d(b_m, p_m) = d(bbar_m, p_m), and Proposition 3.11 later asserts that removing the two gluing vertices b_m and bbar_m disconnects the graph and that every geodesic between antipodal copies passes through one of them. These existence, uniqueness, and cut-point properties are not proved from any formal definition. The cancellations in Lemma 3.12 (d(p_m,b_m)=d(p_m,bbar_m), d(b_m,bbar_m)=d(b_m,eb_m)) and Proposition 3.13 (d(b_N,p_{m,t})=d(bbar_N,p_{m,t})+2|t|) depend on exactly these relations, and they drive the proof that the antipodal sequence is weakly geodesic. As written, the proof of Theorem 3.15 is therefore incomplete unless the omitted definition is supplied or the geometric equalities are stated as explicit lemmas with proofs.
  2. [Lemma 3.10] The proof of Lemma 3.10 contains the unproved inequality d(b_N, ξ) < d(b_N, bbar_N) + d(bbar_N, ξ), introduced with the phrase 'one can get.' This inequality is used to show that certain sequences cannot represent horofunctions, and it underpins the trichotomy of weakly-geodesic rays stated immediately after the lemma. Since the trichotomy is used in Proposition 3.11 to conclude that there are exactly two Busemann points, a rigorous derivation of the inequality (or a precise reference) is needed.
  3. [Proposition 3.11] The proof of Proposition 3.11 asserts that a geodesic from γ(m_1) to γ(m_3) must pass through one of the cut points b_{m_2} or bbar_{m_2}, and then excludes bbar_{m_2} by the informal copy-counting argument: 'to reach bbar_{m_2}, one must either pass through b_{m_1} and then through f(r) copies, or pass through more than f(r)+1 copies of Γ_k.' Neither the disconnectivity statement nor the copy-counting estimate is derived from a formal definition of the hole geometry. These assertions are load-bearing for the 'exactly two Busemann points' part of Theorem 3.15, so they need to be proved or made into explicit geometric axioms.
  4. [Lemma 3.12 and Proposition 3.13] The non-Busemann part of Lemma 3.12 is delegated to '[DD16, Proposition 4.2]' with the note 'almost verbatim' and the identifications v_1 = b_N, v_2 = bbar_N, φ_y(x)=d_x(y). Proposition 3.13 makes the same delegation. The reader is not shown that the hypotheses of [DD16, Proposition 4.2] are satisfied by the sequences and cut points constructed here; in particular, the required distance equalities at all scales are exactly the unformalized k-hole relations. Please spell out the verification of the hypotheses or include the argument directly.
minor comments (5)
  1. [Abstract] The word 'isomorphim' should be 'isomorphism'.
  2. [Definition 3.7] In the odd-r case, the phrase 'the antipodal point p of a hole H in Γξ with respect to ξ is the gluing vertex of the two antipodal copies of the copy of Γm containing ξ' is hard to parse; please clarify which vertices are being glued and why the antipodal point is unique.
  3. [Lemma 3.12] The notation T is used in the definition of P: T → Γξ before T is introduced; please define T explicitly as the unbounded subset of N parametrizing the antipodal sequence.
  4. [Proposition 3.13] The phrase 'if t1t2 < 0' should presumably read 'if t_1 t_2 < 0' with the product of the two shifts; please fix the typography for clarity.
  5. [Theorem 3.15] The statement says the boundary 'contains countably many non-Busemann points,' which is a lower bound. If the intended claim is that the non-Busemann subset is exactly countable, that stronger statement should be stated and proved explicitly.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: Theorem 3.15 is derived from explicit graph constructions and geometric lemmas; the cited non-Busemann criterion is an external, parameter-free result, not a fitted input.

full rationale

The paper's central derivation is self-contained: the graph family is defined by an explicit recursive gluing construction, the isomorphism classification in Theorem 2.4 follows from lemmas proved in the text, and the horofunction boundary result in Theorem 3.15 is built from the antipodal-point construction in Definition 3.7 and the geometric arguments in Proposition 3.11, Lemma 3.12, and Proposition 3.13. The equidistance relation d(b_m,p_m)=d(bar b_m,p_m) is introduced as the defining property of the antipodal point, so later cancellations using it are applications of the definition, not circular reductions. The cut-point assertions are argued geometrically in Proposition 3.11 rather than imported from the conclusion. The only citation of prior work by overlapping authors is [DD16, Proposition 4.2], used to prove that certain constructed sequences are not Busemann points; that cited result is a published, parameter-free mathematical theorem concerning a related but distinct family, and it is not fitted to the present data nor equivalent to the target statement, so under the review rules it counts as independent support rather than circularity. The informal, admittedly omitted formal definition of a k-hole (Definition 3.6) is a rigor/completeness concern, not a circularity: it does not presuppose the count of Busemann or non-Busemann points. No fitted parameter is renamed as a prediction, no uniqueness theorem is imported from the same authors to forbid alternatives, and no known result is merely renamed. Thus the paper does not exhibit a circular derivation.

Assumptions & free parameters 0 free parameters · 3 assumptions · 2 invented entities

The paper introduces no fitted parameters. Its central claims rest on the explicit recursive graph construction (a domain assumption), on standard horofunction theory, and on informally defined geometric objects (holes and antipodal points) whose properties are assumed rather than derived.

assumptions (3)
  • standard math Rieffel's Theorem 3.3: every horofunction is a pointwise limit of weakly-geodesic rays.
    Invoked as Theorem 3.3 to connect geometric rays with horofunctions; accepted background from [Rie02].
  • domain assumption The recursive construction of Γ_k via r copies glued along specified vertices (Section 1).
    The entire paper operates within this recursively defined graph family; the construction is the definition of the object of study, not derived.
  • ad hoc to paper The k-hole and antipodal-point geometric properties, including cut-point behavior and distance equalities.
    The proof assumes that holes have the cut-point and equidistance properties used in Definitions 3.6 and 3.7 and in Lemmas 3.10 to 3.12 and Proposition 3.13; the formal definition of a k-hole is omitted.
invented entities (2)
  • k-hole
    purpose: A subgraph of Γ_k used to define antipodal points and separate copies; the basis for distance arguments in the horofunction proofs.
    Introduced as Definition 3.6 with an informal description and no precise construction; no independent falsifiable handle outside the paper.
  • antipodal point / antipodal sequence
    purpose: Constructs weakly-geodesic rays that yield non-Busemann horofunctions.
    Definition 3.7 and Remark 3.8; entirely internal to the proof apparatus, with no external observable predictions.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Horofunctions of infinite Sierpinski polygon graphs." pith.science (2026). https://pith.science/paper/6USKF7B4

@misc{pith2026250723681,
  author       = {Pith},
  title        = {Pith review of: Horofunctions of infinite Sierpinski polygon graphs},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/6USKF7B4}},
  note         = {Machine review of arXiv:2507.23681}
}
abstract

Generalizing works of D'Angeli and Donno, we describe, starting from an infinite sequence over $r$ letters with $r \neq 4i$ and $i \in \mathbb{N}$, a sequence of pointed finite graphs. We study the pointed Gromov-Hausdorff limit graphs giving a description of isomorphim classes in terms of dihedral groups and providing insights on the horofunction boundaries in terms of Busemann and non-Busemann points.

Figures

Figures reproduced from arXiv: 2507.23681 by the authors.

Figure 1
Figure 1. The cyclic graph P6 and the corresponding pointed graph (Γ(6) 3 , 145) with two gluing vertices highlighted. For example if r = 6, then f(6) = 2 and fe(6) = 4 and hence 004 and 335 identify in Γ (6) 3 , as well as 115 and 440 (see green vertices in [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. A portion of the graph Γ (6) 154. See [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. On the left side, a 3-hole with six facing copies of Γ (6) 3 . On the right side, the points bm and bm for ξ = 433 and i = 3, together with the antipodal point of the hole H in the left figure with respect to ξ. Definition 3.7. If r is even, an antipodal point p of a hole H in Γξ with respect to ξ is a vertex of H such that ξ and p belong to the antipodal copies of Γm facing the hole and such that d(bm, p) = d(bm, p… view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: Two geodesics connecting the gluing vertices as in the proof of [PITH_FULL_IMAGE:figures/full_fig_p011_4.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

5 extracted references · 5 canonical work pages

  1. [33]

    Horofunctions on the Heisenberg and Cartan groups

    Graduate Studies in Mathematics. American Mathematical Society, 2001.doi: 10.1090/gsm/033. 14 [BBM21] James Belk, Collin Bleak, and Francesco Matucci. “Rational em- beddings of hyperbolic groups”. In:J. Comb. Algebra5.2 (2021), pp. 123–183. issn: 2415-6302. doi: 10.4171/jca/52. [BDN17] Ievgen Bondarenko, Daniele D’Angeli, and Tatiana Nagnibeda. “Ends of S...

    work page Pith review arXiv 2021

  2. [1539]

    Horofunctions on sierpinski type triangles

    Lecture Notes in Mathematics. Springer Berlin, Heidelberg, 1993.doi: 10.1007/BFb0092577. [DAn17] Daniele D’Angeli. “Horofunctions on sierpinski type triangles”. In: Utilitas Mathematica105(Nov.2017). url: https://utilitasmathematica. com/index.php/Index/article/view/1174. [DD] Daniele D’Angeli and Alfredo Donno. “Isomorphism classification of infinite Sie...

    work page doi:10.1007/bfb0092577 2016

  3. [2015]

    Gromov boundaries as Markov compacta

    arXiv: 1503.04577. [Per23] D. Perego. “Rationality of the Gromov Boundary of Hyperbolic Groups”

    work page Pith review arXiv

  4. [2023]

    Rationality of the Gromov Boundary of Hyperbolic Groups

    arXiv:2303.09852. [Rie02] Marc A. Rieffel. “GroupC∗-algebras as compact quantum metric spaces”. In:Documenta Mathematica 7 (2002), pp. 605–651. [TY16] Matthew C.H. Tointon and Ariel Yadin. “Horofunctions on graphs oflineargrowth”.In: Comptes Rendus Mathematique354.12(2016), pp. 1151–1154. doi: 10.1016/j.crma.2016.10.015. 15 [WW06] Charles Webster and Adam...

    work page Pith review arXiv 2002

  5. [2024]

    The independence polynomial on recursive sequences of graphs

    arXiv:2411.14791 [math.DS]. url: https://arxiv.org/abs/2411.14791. [Paw15] D. Pawlik. “Gromov boundaries as Markov compacta”

    work page Pith review arXiv

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.