pith. sign in

arxiv: 2605.11833 · v2 · pith:B6YLYS46new · submitted 2026-05-12 · 🧮 math.MG · math.CO

Self-similar dendrites with finite boundary and P-sprouts

Andrei Tetenov , Ivan Yudin , Dmitrii Drozdov This is my paper

Pith reviewed 2026-05-13 04:28 UTC · model grok-4.3

classification 🧮 math.MG math.CO
keywords self-similar dendritesfinite boundarysprout graphbipartite graphtopological structurecombinatorial propertiesfractal trees
0
0 comments X

The pith

A finite graph called the sprout encodes the topology of self-similar dendrites with finite boundaries.

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

Self-similar dendrites are fractal sets that consist of scaled copies of themselves arranged in a tree-like structure. When the boundary of such a dendrite is finite and also self-similar, the construction yields a finite acyclic edge-labeled bipartite graph known as the sprout. The paper establishes that this sprout graph captures the full set of combinatorial properties of the dendrite as well as its topological structure. A reader would care because it reduces the study of certain continuous fractal objects to the discrete data of a small graph.

Core claim

Each self-similar dendrite K with a finite self-similar boundary defines a finite acyclic edge-labeled bipartite graph G, called the sprout of K, and this graph G determines the combinatorial properties of the dendrite K and its topological structure.

What carries the argument

The sprout G, a finite acyclic edge-labeled bipartite graph derived from the self-similar boundary of the dendrite.

If this is right

  • The topology of any such dendrite can be reconstructed directly from its sprout graph.
  • Combinatorial invariants of the dendrite become readable as graph-theoretic properties of the sprout.
  • Classification of self-similar dendrites with finite boundaries reduces to enumeration of admissible sprout graphs.
  • Topological equivalence between two such dendrites can be decided by comparing their sprouts.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Algorithms could generate all admissible dendrites by enumerating small sprout graphs and checking which ones produce valid self-similar realizations.
  • The same reduction might extend to other classes of self-similar continua once a suitable notion of sprout is defined for them.
  • One could test the framework by constructing explicit examples from given small graphs and verifying that the resulting sets satisfy the self-similarity and boundary conditions.
  • The approach supplies a discrete skeleton that could be used to compute metric properties such as Hausdorff dimension from the graph alone.

Load-bearing premise

Every self-similar dendrite with finite self-similar boundary admits a well-defined finite sprout graph whose combinatorial data suffices to reconstruct the topology.

What would settle it

A concrete self-similar dendrite with finite boundary whose topology cannot be recovered from its associated sprout graph, or two topologically distinct dendrites that produce identical sprouts.

Figures

Figures reproduced from arXiv: 2605.11833 by Andrei Tetenov, Dmitrii Drozdov, Ivan Yudin.

Figure 1
Figure 1. Figure 1: The attractor K is on the left, its P-sprout is at center and index diagram is on the right. The sequence of predecessors of p4 is shown below. If the system S has the finite intersection property, we define its intersection graph Γ(S) [30] as an edge-labeled bipartite graph (W, B; E) with parts W and B, in which an edge e = (Ki , p) ∈ E if and only if p ∈ Ki . Here, a label assigned to the edge e = (Ki , … view at source ↗
Figure 2
Figure 2. Figure 2: A sprout on the left is not correctly defined (3 [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Example of an inadmissible P-sprout (on the left) and its index diagram (on the right). Lemma 3.6. Let the attractor K(S) of a system S = {S1, S2, . . . , Sm} be a self-similar dendrite with a finite boundary. For any x ∈ K, Ord(x, K) ≥ #π −1 (x) if the set π −1 (x) is finite and Ord(x, K) is infinite if π −1 (x) is infinite. Proof. If the point x ∈ K has l different addresses α k = i k 1 i k 2 ...., then … view at source ↗
Figure 4
Figure 4. Figure 4: The left column shows how the sprout Γ2 (at the bottom) is obtained from the sprout Γ (at the top). The middle picture shows the neighborhoods of points 1,2 and 3 that shrink to each of these points. Right column shows the systems of copies Ki and Kij . 7 [PITH_FULL_IMAGE:figures/full_fig_p007_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: A self-affine dendrite K (left), its P-sprout (center) and the index diagram (right). The point p2 ∈ ∂K has an uncountable number of addresses (by case 3 from Proposition 5.4). Each of the points p1, p3 ∈ ∂K has one address (by case 1 from Proposition 5.4). Proof. Each infinite walk ω = ω(p0, ...) in G contains some cycle σ. If ω leaves σ at some point p, then its subwalk ω ′ (p, ...), contains some cycle … view at source ↗
Figure 6
Figure 6. Figure 6: P-sprout Γ on the left and Γ1 on the right. ϕ1(P) = {p1, p2, p4}. The subtree ˆγ1 is shown on the left and its image S1(ˆγ1) = K1 ∩ γˆ is on the right. The map ϕi can be interpreted and then redefined in terms of subarcs of the main tree ˆγ in the following way: Lemma 6.1. Let γ(p, Ki) be the minimal arc connecting p and Si(K) in the dendrite K. Then its endpoint in Ki is γ(p, Ki) ∩ ∂Ki = Si(ϕi(p)). □ The … view at source ↗
Figure 7
Figure 7. Figure 7: An attractor K and its main tree ˆγ on the center. Its P-sprout on the left and its index diagram on the right. The points p1, p2, . . . p6 are the boundary points. Ord(p2, γˆ) = 2, Ord(p3, γˆ) = 3. All the other points are endpoints. An example of this situation is shown in [PITH_FULL_IMAGE:figures/full_fig_p014_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Applying the result to an example in Fig. [PITH_FULL_IMAGE:figures/full_fig_p015_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: An attractor K and its main tree ˆγ on the left. Its P-sprout on the right. The points a, b, c, d are the ramification points of the main tree. π −1 (a) = 34, π−1 (b) = 234, π−1 (c) = 43, π−1 (d) = 543. 15 [PITH_FULL_IMAGE:figures/full_fig_p015_9.png] view at source ↗
read the original abstract

Each self-similar dendrite K with a finite self-similar boundary defines a finite acyclic edge-labeled bipartite graph G, called the sprout of K. The paper shows that the sprout G determines the combinatorial properties of the dendrite K and its topological structure.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The manuscript defines the sprout G of each self-similar dendrite K possessing a finite self-similar boundary as a finite acyclic edge-labeled bipartite graph. It establishes that the combinatorial data of G determines the combinatorial properties of K and suffices to reconstruct its topological structure.

Significance. If the construction and reconstruction are fully rigorous, the result supplies a finite combinatorial model for an infinite topological object, which could streamline classification, computation of invariants, and comparison of self-similar dendrites in metric geometry. The explicit use of acyclicity and bipartiteness to encode branching and attachment is a clear strength.

minor comments (3)
  1. The definition of the sprout graph (likely in §2) should include an explicit statement of the label alphabet and the precise rule by which edges receive labels from the self-similarity data.
  2. An illustrative example computing G for a concrete dendrite (e.g., the Wazewski universal dendrite or a simple iterated function system) would strengthen the reconstruction claim.
  3. The manuscript should clarify whether the bipartition of G corresponds to a canonical partition of the dendrite's vertices or edges, and state this explicitly in the reconstruction theorem.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of our manuscript and for recommending minor revision. The referee's summary correctly identifies the core contribution: the sprout G as a finite acyclic edge-labeled bipartite graph that encodes the combinatorial and topological structure of the self-similar dendrite K with finite self-similar boundary. We are pleased that the potential utility for classification and invariant computation is noted.

Circularity Check

0 steps flagged

No significant circularity; standard construction and reconstruction

full rationale

The paper constructs the sprout G directly from the self-similar dendrite K with finite boundary as a finite acyclic edge-labeled bipartite graph, then proves that the combinatorial data of G encodes and reconstructs the topological structure of K. This is a definitional invariant plus reconstruction theorem, not a reduction where a claimed prediction equals its inputs by construction, a fitted parameter is relabeled as a prediction, or a load-bearing step collapses to an unverified self-citation. The argument is self-contained against the stated assumptions of self-similarity and finite boundary, with no ansatz smuggling or renaming of known results as new derivations.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The result rests on the existence of self-similar dendrites with finite self-similar boundaries and on the ability to extract a finite graph from their self-similarity structure; no free parameters or invented physical entities appear.

axioms (1)
  • domain assumption Self-similar dendrites with finite self-similar boundaries exist and admit a canonical finite acyclic edge-labeled bipartite graph (the sprout).
    Invoked by the opening sentence of the abstract as the starting point for the construction.
invented entities (1)
  • Sprout graph G no independent evidence
    purpose: Finite discrete object that encodes the combinatorial and topological data of the dendrite K
    Newly introduced in the paper; no independent existence outside the construction is claimed.

pith-pipeline@v0.9.0 · 5326 in / 1197 out tokens · 34457 ms · 2026-05-13T04:28:55.124446+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

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.