Pith. sign in

REVIEW 2 major objections 5 minor 3 references

Limit spaces of vertex and edge replacement systems

T0 review · 2 major / 5 minor · reviewed 2026-08-15 · deepseek-v4-flash

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

Pith's one-line read The paper claims that an expanding vertex and edge replacement system always yields a hyperbolic history graph, and that the Gromov boundary of that graph unifies the limit spaces of self-similar groups, iterated function systems, and…

desk verdict Solid VERS framework, but the IFS homeomorphism proof has an unpatched gap: the boundary map is only defined on vertical rays and the paper never shows every boundary point has one. read the letter →

arxiv 2508.20739 v1 pith:YU2BLTLL submitted 2025-08-28 math.CO math.DSmath.GR

Davide Perego , Matteo Tarocchi This is my paper · ORCID
classification math.COmath.DSmath.GR MSC 20F6505C2528A8037B1005C12
keywords vertexandedgereplacementsystemhistorygraphGromovboundaryhyperbolicself-similargroupiteratedfunctionaugmentedtree
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

The paper introduces VERSs, a general recipe for building graphs level by level: a starting bouquet of loops is expanded by finitely many rules that replace vertices and edges according to their types and colors. Each VERS has a history graph, an augmented tree whose vertical edges record ancestry and whose horizontal edges record adjacency at each level. The paper proves that if the VERS is expanding—informally, if iterated replacement eventually lengthens every possible shortest path—then this history graph is hyperbolic. The Gromov boundary of that graph is then defined to be the limit space of the VERS. The payoff is that three established limit-space constructions, from contracting self-similar groups, injective post-critically finite iterated function systems, and expanding edge replacement systems, all appear as special cases of this one boundary construction.

What carries the argument

The load-bearing object is the history graph of the VERS, an augmented tree: vertical edges form a rooted tree recording each expansion step, and horizontal edges join vertices on the same level that are adjacent in that level's graph. The paper uses two tools on this structure. The first is the spanning lift of a horizontal edge, the unique edge one level down whose expansion produced it; lifting cannot increase distances, and this links lengths of shortest paths across levels. The second is the no-big-squares criterion for augmented trees: an augmented tree is hyperbolic exactly when the side lengths of its geodesic squares are uniformly bounded. The expanding condition for VERSs is engineered so that any geodesic square of side n would force a length-n path whose n-th expansion still contains a length-n shortest path, contradicting Definition 3.8. A separate bridge, barycentric subdivision—inserting a new vertex inside every edge—converts edge replacement expansions into VERS expansions and carries the ERS limit space over.

What would settle it

Take a candidate expanding replacement system and expand, n times, every length-n chain of edges that the rules allow; if any such expanded level still contains a shortest path of length n running between the two endpoint descendants, the system is not expanding, and if such a square appears in a system that is expanding, the main hyperbolicity theorem is false.

Watch

Extended reading notes

Core claim

The central claim is Theorem 3.12: an expanding VERS has a hyperbolic history graph. Since a hyperbolic graph has a well-defined Gromov boundary, this lets the paper define the limit space of a VERS as that boundary. For a finitely generated contracting self-similar group, the associated VERS reproduces the known self-similarity graph, so its boundary is the group's limit space. For an injective post-critically finite iterated function system, the horizontal edges of the history graph correspond exactly to non-empty intersections of cylinder sets, and the boundary is homeomorphic to the attractor. For an expanding edge replacement system, the VERS expansions are barycentric subdivisions of the ERS expansions, and the boundary is homeomorphic to the ERS limit space. In all three cases the same abstract object—the boundary of one hyperbolic augmented tree—recovers the previously studied space.

Load-bearing premise

The construction for iterated function systems assumes the contracting maps never overlap except at finitely many special points, those special points stay at positive distances from one another, and a continuity argument borrowed from an earlier construction still works on this particular tree; if any of those assumptions fails, the claimed homeomorphism may fail.

Editorial extensions

If this is right

  • Every expanding VERS has a well-defined, compact, metrizable limit space: the visual Gromov boundary of its history graph.
  • Schreier graphs of any finitely generated contracting self-similar group can be generated by one uniform recursive procedure instead of ad hoc constructions.
  • For injective pcf IFSs, the attractor is homeomorphic to a single hyperbolic graph boundary, with horizontal edges encoding exactly which cylinder intersections are non-empty.
  • Expanding edge replacement systems, including the standard examples of rearrangement-group fractals, have limit spaces that are homeomorphic to VERS boundaries, so they inherit compactness and metrizability.
  • Hyperbolicity of a history graph is strictly more general than the expanding condition: the authors give an explicit VERS whose history graph is hyperbolic but which is not expanding.

Reading between the lines

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

  • Inference: since the IFS part of the construction never uses similarity ratios, the identification of boundary with attractor is purely topological; two attractors that are metrically different could still have the same VERS boundary, and the framework offers no metric control.
  • Inference: replacing the full shift by an arbitrary edge shift in the IFS VERS would likely produce a graph-directed version of the correspondence, connecting the construction to graph-directed fractal families.
  • Inference: the barycentric-subdivision bridge looks flexible enough to carry VERS technology to hyperedge replacement systems, which would give limit spaces with isolated points and almost-expanding behaviors.
  • Inference: if the suggested VERS structure on atoms of hyperbolic groups exists, then Gromov boundaries of hyperbolic groups would come with a recursive expansion description, potentially making boundary homeomorphism questions computational.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 5 minor

Summary. The paper introduces vertex and edge replacement systems (VERSs), a general formalism for recursively expanding colored, typed graphs. For a VERS it defines a history graph, an augmented tree whose n-th level records the n-th expansion, and, when this graph is hyperbolic, defines the limit space of the VERS as its Gromov boundary. The main structural result is Theorem 3.12, stating that an expanding VERS has a hyperbolic history graph. The framework is then applied to three settings: finitely generated contracting self-similar groups, where the history graph is shown to coincide with Nekrashevych's self-similarity graph and the limit space with the group's limit space (Section 4); injective post-critically finite iterated function systems, where the history graph is shown to be hyperbolic and its boundary homeomorphic to the attractor (Section 5); and Belk-Forrest edge replacement systems, where the barycentric subdivision construction yields a VERS whose limit space is homeomorphic to the ERS limit space (Section 6).

Significance. The VERS framework is a useful unifying language for several families of recursively constructed graphs and their limit spaces. The hyperbolicity criterion in Theorem 3.12 is simple, explicit, and semi-decidable for a fixed expansion bound, and the three applications demonstrate the breadth of the formalism. The self-similar-group and ERS applications are largely reformulations or adaptations of known results, but the framework itself is new and the ERS homeomorphism in Theorem 6.17 gives a fresh perspective on Belk-Forrest limit spaces. The IFS section recovers and extends existing self-similar-set boundary constructions, though its homeomorphism proof is not fully self-contained. Overall, if the proof gaps identified below are closed, the paper would be a solid contribution to the literature on graph expansions and fractal limit spaces.

major comments (2)
  1. [§5.5, Theorem 5.17] The proof of the homeomorphism between the Gromov boundary of HΦ and the attractor K is incomplete. The map χ is defined and analyzed only on geodesic rays of the form ...a2a1, and the paper does not explicitly justify that every boundary point is represented by such a ray. In an augmented tree, any geodesic ray starting at the root must be purely vertical, because a horizontal edge connects vertices of the same level and would make the corresponding prefix longer than the distance from the root; however, this observation is not stated. More importantly, the continuity of χ is delegated to [LW09, Theorem 4.3] with the remark that its proof 'works with minimal modifications', but the specific modifications and the verification that the listed ingredients (Equation 2.1, Propositions 2.2, Theorem 2.3, Lemma 4.1 of [LW09]) apply verbatim to the different augmented tree HΦ are not provided. Since this is the load-bearing step for the IFS application, the authors should either supply a complete proof of continuity in their setting or give a precise statement of which parts of [LW09] transfer and why the differences between the two augmented trees are immaterial.
  2. [§5.4, Proposition 5.14 and Theorem 5.15] The hyperbolicity proof for the history graph of an injective pcf IFS uses the ratio R := min{d(p,q) : p,q ∈ PCrit} / max{d(p,q) : p,q ∈ PCrit} as a threshold for the contracting ratio. This ratio is undefined when PCrit is empty or a singleton, and the manuscript does not discuss these degenerate cases. For an IFS with no critical intersections, the history graph is a purely vertical tree and the claim is trivially true; for a singleton PCrit a separate argument is needed. Theorem 5.15 asserts hyperbolicity for every injective pcf IFS, so the proof should either rule out these cases or treat them separately.
minor comments (5)
  1. [§2.2, Definition 2.4 and expansion description] In the description of edge expansion, the phrase 'the edge xa→ya of R_{c(e)} (a∈{i,t})' is confusing and likely a typo: since edges of R_c connect vertices of the form x_i or x_t, the edge should be written x_a → y_b with a,b ∈ {i,t}, and the replacement of i by u and t by v should be applied to each endpoint independently.
  2. [§5.5, Lemma 5.16 and Theorem 5.17] The notation T_{i≥1}K_{a_i} should be T_{i≥1}K_{a_i...a_1} (or an explicit parenthetical clarification) to be consistent with the definition of χ in Subsection 5.1, where K_w is defined for finite words w.
  3. [§3.2, Lemma 3.11] In the proof of Lemma 3.11, the endpoints of the top side T of a geodesic (n+1)-square are set to be P^n(u) and P^n(v), but since the vertical sides have length n+1, these endpoints should be P^{n+1}(u) and P^{n+1}(v). The apparent off-by-one propagates through the construction of the subsquare; the lemma itself is true and the argument is repairable, but the written proof should be corrected.
  4. [§5.4, Proposition 5.14] The statement of Proposition 5.14 should explicitly assume that PCrit has at least two distinct points so that the ratio min/max is defined and positive; otherwise the condition is vacuous or undefined for degenerate IFSs.
  5. [§3.2, Theorem 3.12 and Remark 3.13] The paper would benefit from a brief explicit statement that in an augmented tree, every geodesic ray starting from the root is purely vertical (the argument is one sentence: a horizontal edge preserves the level, so its use would make a prefix longer than the distance from the root). Such a remark would clarify the discussion of geodesic rays in Sections 5 and 6.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the main derivations are self-contained and the load-bearing results use external criteria rather than self-citations.

full rationale

The paper's derivation chain is not circular. Theorem 3.12, the central hyperbolicity result, is proved from the no-big-squares criterion of Kaimanovich (Theorem 3.10) and the paper's expanding condition (Definition 3.8). The expanding condition is a sufficient condition stated independently of hyperbolicity, as Remark 3.13 explicitly notes that it is not necessary, so the theorem is not a restatement of the definition. The group application identifies the VERS history graph with Nekrashevych's self-similarity graph (Theorem 4.3) and then imports hyperbolicity and the limit space from [Nek03] and [Nek05]; these are external, independently established results, not self-citations. The IFS application builds the VERS from the IFS data, proves the edge-intersection correspondence from the replacement rules (Propositions 5.4 and 5.5, Theorem 5.7), proves hyperbolicity using Kaimanovich's criterion after passing to powers (Lemmas 5.10-5.12, Proposition 5.14, Theorem 5.15), and identifies the boundary with the attractor using the standard address map from [Kig01]. The continuity step in Theorem 5.17 is delegated to [LW09, Theorem 4.3] with 'minimal modifications', but that is an external cited theorem, and any failure to transfer would be a correctness gap rather than circular reasoning. The ERS application similarly proves that an expanding ERS gives an expanding VERS and then uses its own propositions to identify the limits spaces; the definition of expanding ERS is from [BF19], again external. The self-citations ([Per23], [PT24], [PT25]) appear only in remarks or final remarks and do not carry any load-bearing proof. Overall, the paper's claims are benchmarked against external results and its internal reductions go from definitions to conclusions without fitting inputs or renaming known results.

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

The central theorem uses only standard background. No free parameters are fitted to data. The main external inputs are Kaimanovich's criterion for augmented trees, Nekrashevych's hyperbolicity of self-similarity graphs, standard IFS attractor theory, and Belk-Forrest's ERS limit space results.

assumptions (5)
  • standard math Kaimanovich's no-big-squares theorem (Theorem 3.10 of [Kai03]) characterizes hyperbolicity of augmented trees.
    Used as the main hyperbolicity criterion in Theorem 3.12 and throughout; the paper assumes this external theorem.
  • standard math Gromov boundary basics: boundary is independent of basepoint, compact metrizable under the visual topology.
    Used in Definitions 3.1-3.2 and when identifying boundaries.
  • standard math For a contracting self-similar group, the self-similarity graph is hyperbolic and its boundary is the group limit space ([Nek03, Theorem 4.2]).
    Used in Corollary 4.4 to identify the VERS limit space with the known limit space.
  • domain assumption Attractor theory for injective pcf IFSs: existence and uniqueness of the attractor, addresses, and Hutchinson operator limits.
    The IFS construction in Section 5 relies on these standard facts from fractal geometry.
  • domain assumption For expanding ERSs, the gluing relation is an equivalence relation and the limit space is compact and metrizable ([BF19, Proposition 1.9, Theorem 1.25]).
    Used as the external benchmark in Section 6 to identify the VERS boundary with the ERS limit space.
invented entities (3)
  • Vertex and edge replacement system (VERS)
    purpose: Formal model of recursive graph expansions driven by an edge shift, colors, and replacement graphs.
    The paper's central new object; it is a mathematical definition, not an empirical postulate, so there is no external falsifiable handle.
  • History graph of a VERS
    purpose: Augmented tree recording all expansion levels and horizontal edges of a VERS.
    A technical construction used to define hyperbolicity and the boundary; no independent evidence is needed.
  • Limit space of a VERS
    purpose: The Gromov boundary of the history graph, intended as the infinite limit of the expansions.
    Defined when the history graph is hyperbolic. Its value comes from matching known limit spaces in the three examples, not from independent empirical evidence.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Limit spaces of vertex and edge replacement systems." pith.science (2026). https://pith.science/paper/YU2BLTLL

@misc{pith2026250820739,
  author       = {Pith},
  title        = {Pith review of: Limit spaces of vertex and edge replacement systems},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/YU2BLTLL}},
  note         = {Machine review of arXiv:2508.20739}
}
read the original abstract

We introduce and study VERSs (vertex and edge replacement systems) as a technology of graph expansions. We consider its history graph, an augmented tree that records each graph expansion, and we provide sufficient conditions under which it is hyperbolic. When hyperbolic, its Gromov boundary is what we call the limit space of the VERS. We provide three examples from different areas of mathematics: Schreier graphs and limit spaces of finitely generated contracting self-similar groups, injective post-critically finite iterated function systems and limit spaces of edge replacement systems.

Figures

Figures reproduced from arXiv: 2508.20739 by the authors.

Figure 1
Figure 1. The automaton for the basilica group B [PITH_FULL_IMAGE:figures/full_fig_p011_1.png] view at source ↗
Figure 2
Figure 2. The basilica Julia set (image by Prokofiev). Some of these VERS are not expanding, see Remark 3.13. However, even without knowing if such a VERS is expanding, we can conclude that its history graph is hyperbolic by Theorem 4.3 together with [Nek03, Theorem 4.2]. These VERSs allow us to construct the Schreier graphs of any finitely gener￾ated contracting self-similar group through a simple recursive procedure, as VER… view at source ↗
Figure 3
Figure 3. The replacement graphs of the VERS R(B, S). a b c d 1 0|0 1|1 0|1 1|0 0|0 1|1 0|0 1|1 0|0 1|1 [PITH_FULL_IMAGE:figures/full_fig_p012_3.png] view at source ↗
Figures from the paper (6 more)
Figure 4
Figure 4. Figure 4: The automaton for the Grigorchuk group G. the case in which the 1-colored edge being expanded is a loop, with i = t denoted by x instead. 4.3.2. The Grigorchuk group. The Grigorchuk group is the contracting self-similar group G generated by the automaton depicted in […
Figure 5
Figure 5. Figure 5: The replacement graphs of the VERS R(G, S). An iterated function system (IFS for short) is a finite set Φ = {ϕi}i∈A of contracting maps ϕi : X → X. If C1, . . . , CN are contracting ratios for ϕ1, . . . , ϕN , respectively, then we say that max{C1, . . . , CN } is a co…
Figure 6
Figure 6. Figure 6: The Sierpi´nski triangle. Example 5.1. The Sierpi´nski triangle ( [PITH_FULL_IMAGE:figures/full_fig_p014_6.png]
Figure 7
Figure 7. Figure 7: The replacement graphs of the VERS RST . K1, and the one for ( 1 2 l r ) by the fact that (l)ϕ −1 1 = l ∈ K1 and (r)ϕ −1 2 = r ∈ K2. The replacement graph of c0 is depicted in the case in which the c0-colored edge is a loop, since this is always the case for the VERSs …
Figure 8
Figure 8. Figure 8: An ERS for the basilica Julia set. 6.1.1. Edge replacement systems. Definition 6.1. An edge replacement system (or ERS) consists of: • a set C of colors; • a base graph E0 colored by C; • for each c ∈ C, a replacement graph Xc colored by C and equipped with two vertice…
Figure 9
Figure 9. Figure 9: The VERS associated to the ERS EB. the two edges by the barycentric subdivision of Xc. Ultimately, this shows that the VERS expansion of Xb is the barycentric subdivision of X′ . □ Corollary 6.11. The n-th expansion Γn of the VERS RE is the barycentric sub￾division of …

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

3 extracted references · 1 canonical work pages

  1. [181]

    Quasisymmetries of the basil- ica and the Thompson group

    isbn: 978-3-11-070076-3. doi: 10.1515/9783110700763-006. [LM18] Mikhail Lyubich and Sergei Merenkov. “Quasisymmetries of the basil- ica and the Thompson group”. In: Geom. Funct. Anal. 28.3 (2018), pp. 727–754. issn: 1016-443X,1420-8970. doi: 10.1007/s00039-018- 0452-0. [LW09] Ka-Sing Lau and Xiang-Yang Wang. “Self-similar sets as hyperbolic boundaries”. I...

    work page doi:10.1515/9783110700763-006 2018

  2. [183]

    Ends of Schreier graphs and cut-points of limit spaces of self-similar groups

    issn: 2415-6302,2415-6310. doi: 10.4171/jca/52. [BDN17] Ievgen Bondarenko, Daniele D’Angeli, and Tatiana Nagnibeda. “Ends of Schreier graphs and cut-points of limit spaces of self-similar groups”. In: J. Fractal Geom. 4 (2017), pp. 369–424. doi: 10.4171/JFG/55. [BF19] James Belk and Bradley Forrest. “Rearrangement groups of fractals”. In: Trans. Amer. Mat...

    arXiv 2017

  3. [2023]

    Eventually Self-Similar Groups acting on Fractals

    arXiv: 2303.09852. [PT24] Davide Perego and Matteo Tarocchi. “Eventually Self-Similar Groups acting on Fractals”. 2024. arXiv: 2412.04138. [PT25] Davide Perego and Matteo Tarocchi. “Rational gluing in edge replace- ment systems”. In:Internat. J. Algebra Comput. 35.1 (2025), pp. 81–96. issn: 0218-1967,1793-6500. doi: 10.1142/S0218196724500577 . url: https:...

    arXiv 2025

Pith tools

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