arxiv: 2605.03990 · v1 · submitted 2026-05-05 · 🧮 math.MG

Recognition: unknown

On metric properties of self-affine polygonal dendrites

Andrei Tetenov, Dilmurat Kutlimuratov, Ivan Yudin

Pith reviewed 2026-05-08 17:30 UTC · model grok-4.3

classification 🧮 math.MG

keywords gammalambdapolygonalself-affineconstantsdendritedendritesdiam

0 comments

The pith

For self-affine dendrites generated by polygonal systems, the diameter of any connecting Jordan arc is bounded by C times the endpoint distance to the power λ for some λ in (0,1).

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

The authors prove a specific inequality for self-affine dendrites created by polygonal systems of affine maps. For any two points in the dendrite, the unique arc connecting them has its diameter at most a constant times their separation raised to a fractional power. This establishes a form of metric regularity that controls the global geometry of the fractal. A sympathetic reader would see this as a way to ensure that the dendrite does not contain paths that stray too far when connecting nearby points. The proof relies on the structure preserved by the polygonal generating system.

Core claim

The central result is that for any self-affine dendrite K generated by a polygonal system, there exist constants C > 0 and λ ∈ (0,1) such that for any x, y in K, if γ is the Jordan arc in K with endpoints x and y, then diam(γ) ≤ C |x-y|^λ.

What carries the argument

A polygonal system, which is an iterated function system of affine maps producing a dendrite whose structure allows control over arc diameters.

Load-bearing premise

The self-affine dendrite must be generated by a polygonal system of affine maps that preserve polygonal structure and yield a cycle-free connected attractor.

What would settle it

Identify a self-affine dendrite from a polygonal system together with points x and y where diam(γ) exceeds C |x-y|^λ for every choice of C and λ in (0,1).

Figures

Figures reproduced from arXiv: 2605.03990 by Andrei Tetenov, Dilmurat Kutlimuratov, Ivan Yudin.

**Figure 1.** Figure 1: The attractor K on the left has 4 copies. The bipartite intersection graph is shown on the right. Definition 1. A dendrite is a locally connected continuum that does not contain simple closed arcs. The following criterion that was proved in [7] makes it possible to distinguish self-similar dendrites that have the single-point intersection property. Theorem 1. Let S = {S1, . . . , Sm} be a system of injecti… view at source ↗

**Figure 2.** Figure 2: A polygonal system with 8 copies.The union of small polygons P1 −P8 is simply connected. For a polygonal system, we denote Pi = Si(P), Vi = Si(V ). By definition, P ⊃ K, therefore, Pi ⊂ Ki . Condition 2) means that T(V ) ⊃ V , and consequently, V ⊂ K. Then, Pi ⊂ Pj iff Ki ⊂ Kj , and if i and j are incomparable, Ki ∩ Kj = Pi ∩ Pj = Vi ∩ Vj . For simply connected polygonal systems, the following Theorem is t… view at source ↗

read the original abstract

We prove that for any self-affine dendrite K generated by a polygonal system, there are constants C>0 and $\lambda\in(0, 1)$ such that for any x, y in K, the Jordan arc $\gamma$ in K with endpoints x, y satisfies the inequality $diam({\gamma})\le C |x-y|^\lambda$.

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.

Desk Editor's Note private letter to a colleague

The paper gives a clean inductive proof that polygonal self-affine dendrites satisfy a uniform Hölder bound between arc diameter and Euclidean distance.

read the letter

The main takeaway is that for dendrites generated by polygonal affine IFS the authors establish constants C and λ in (0,1) such that the diameter of the unique connecting arc is at most C times the straight-line distance to the power λ. They build λ from the supremum of the operator norms of the linear parts and run an induction that keeps each arc inside the convex hull of a single cylinder at every level of the construction. That step uses the polygonal assumption to prevent arcs from escaping the local geometry in uncontrolled ways. The argument looks direct and avoids the usual pitfalls with direction-dependent contractions or overlapping images. No circularity or hidden uniformity assumptions appear in the induction. The result is new for this exact class of dendrites, though the abstract gives little context on how it sits against earlier bounds for other self-similar sets. The polygonal restriction is the clearest limitation; without it the induction step would not hold in the same form, so the theorem does not extend to general self-affine dendrites. The paper also does not claim sharpness for λ or compare the bound to existing quantitative results in the literature, which leaves the precise advance somewhat narrow. Readers who work on metric properties of fractals and dendrites will get a usable quantitative relation for dimension estimates and embedding questions. The proof is concrete enough and the induction checks out on the details given, so the paper has enough substance to warrant a serious referee. I would send it out for peer review.

Referee Report

0 major / 2 minor

Summary. The manuscript proves that any self-affine dendrite K arising from a polygonal iterated function system admits constants C>0 and λ∈(0,1) such that diam(γ)≤C|x−y|^λ for the unique Jordan arc γ connecting arbitrary x,y∈K. The argument constructs λ from the supremum of the operator norms of the linear parts of the IFS maps and proceeds by induction on the levels of the IFS, using the polygonal assumption to ensure that connecting arcs remain inside the convex hull of a single cylinder at each scale.

Significance. If correct, the result supplies a uniform Hölder bound on arc diameters that is derived directly from the IFS data (via the operator-norm supremum) without additional fitting parameters. This is a useful metric regularity statement for self-affine dendrites and could support subsequent work on their Hausdorff measures or quasi-symmetric embeddings. The inductive control via convex hulls and the explicit construction of λ are clear strengths of the approach.

minor comments (2)

[§2] The precise statement of the polygonal IFS assumption (that the images of the initial polygon under the affine maps remain polygons whose edges align in a way that prevents arc escape) would benefit from a short formal definition in §2 before the induction begins.
[§3] In the induction step, the passage from level n to n+1 could include one additional sentence clarifying why the polygonal structure rules out arcs that traverse multiple cylinders at the same scale.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript, including the recognition that the result provides a uniform Hölder bound on arc diameters derived directly from the IFS data. We appreciate the recommendation to accept.

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained

full rationale

The central result is an existence proof for constants C and λ satisfying the arc-diameter bound in any self-affine polygonal dendrite. λ is constructed explicitly as a function of the supremum of the operator norms of the linear parts of the IFS maps, and the bound is obtained by induction on cylinder levels, using the polygonal structure to guarantee that connecting arcs remain inside the convex hull of a single level-n set. No equation or step equates the target inequality to a fitted quantity, renames an input, or reduces the claim to a self-citation whose content is unverified; the geometric estimates at each scale are independent of the final statement.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The claim rests on standard definitions of self-affine iterated function systems, dendrites, and Jordan arcs; no free parameters or new entities are introduced in the abstract.

axioms (1)

domain assumption A self-affine dendrite generated by a polygonal system is a compact connected locally connected set without cycles, obtained as the attractor of an IFS consisting of affine contractions that map a polygon into sub-polygons.
Invoked implicitly by the phrase 'self-affine dendrite K generated by a polygonal system'.

pith-pipeline@v0.9.0 · 5348 in / 1273 out tokens · 40552 ms · 2026-05-08T17:30:03.730538+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

8 extracted references · 6 canonical work pages

[1]

Intersections of the pieces of self-similar den- dritesinthe plane,Chaos, Solitons and Fractals182:114805https://doi.org/10.1016/j.chaos

Allabergenova,K., Samuel,M., Tetenov,A.(2024). Intersections of the pieces of self-similar den- dritesinthe plane,Chaos, Solitons and Fractals182:114805https://doi.org/10.1016/j.chaos. 2024.114805

work page doi:10.1016/j.chaos 2024
[2]

Aseev, V.V., Tetenov, A.V., Kravchenko, A.S. (2003). On Self-similar Jordan Curves on the Plane. Siberian Mathematical Journal44: 379–386 .https://doi.org/10.1023/A:10238483278984

work page doi:10.1023/a:10238483278984 2003
[3]

Hata, M. (1985). On the structure of self-similar sets.Japan Journal of Applied Mathematics2(2): 381–414.https://doi.org/10.1007/bf03167083

work page doi:10.1007/bf03167083 1985
[4]

Hutchinson, J. (1981). Fractals and Self-Similarity.Indiana University Mathematics Journal 30(5): 713–747.https://doi.org/10.1512/iumj.1981.30.300552

work page doi:10.1512/iumj.1981.30.300552 1981
[6]

Samuel M., Tetenov A., Vaulin D. (2017). Self-Similar Dendrites Generated by Polygonal Systems in the Plane.Siberian Electronic Mathematical Reports14: 737–751.https://doi.org/10.17377/ semi.2017.14.0631, 2, 3, 4

2017
[7]

Tetenov, A., Yudin, I., Kadirova, M. (2025). Finiteness properties for self-similar continua.Dis- crete and Continuous Dynamical Systems – Series S.2025057: 1–13.https://doi.org/10.3934/ dcdss.20250572

2025
[8]

V¨ ais¨ al¨ a, J.(1991) Bounded turning and quasiconformal maps.Monatshefte f¨ ur Mathematik111: 233–244https://doi.org/10.1007/BF012942691, 4

work page doi:10.1007/bf012942691 1991
[9]

Wen, Zhi-Ying, and Li-Feng Xi. (2003). Relations among Whitney sets, self-similar arcs and quasi- arcs.Israel Journal of Mathematics136.1: 251–267.https://doi.org/10.1007/BF028072004 7

work page doi:10.1007/bf028072004 2003