WorksMathematics
Contact multiplicity and a sharp six-map bound for collinear self-similar dendrites
Abstract
Let be the attractor of similarities , , whose fixed points are evenly spaced on a line, and suppose that does not lie in a line. We prove that can be a dendrite only if , and that such dendrites exist for every ; no separation or finite-intersection hypothesis is imposed. Hence, for , every connected of this kind has interior points or separates the plane. Neighboring pieces of meet in similar copies of a single contact set. In a dendrite exactly one first-level piece meets this set, whereas for at least do, a bound attained by explicit quadratic parameters. The proof combines a planar translation obstruction for replicated contact arcs with an estimate based on Jensen's formula. After normalizing to , , the connectedness locus is the closure, outside the unit disk, of the roots of monic integer polynomials of height at most . The same estimate shows that, for , every such polynomial with a non-real root satisfying has subleading coefficient of absolute value at most , and that this bound is sharp. Accordingly, for , at every non-real boundary point of the locus with , each expansion with integer digits has .
Introduction
Let , let with , and let be the attractor [27] of the similarities
The maps share their linear part, and their fixed points are evenly spaced on a line; conversely, every system of orientation-preserving similarities with a common linear part and evenly spaced fixed points has this form. If is real, the line through the fixed points is invariant and contains . If is not real, lies in no line: a line would give , a single point, whereas is injective and contains the distinct fixed points of and .
A dendrite is a locally connected continuum containing no simple closed curve; its points are joined by unique arcs [15, 34]. In the plane, a locally connected continuum is a dendrite if and only if it has empty interior and does not separate the plane. Indeed, a dendrite has empty interior, since a disk contains a simple closed curve, and it is contractible, so Alexander duality shows that it does not separate the plane; conversely, if a non-separating continuum contains a simple closed curve, then the bounded complementary domain of that curve lies in the continuum. Planar self-similar dendrites are thus exactly the self-similar continua that are simply connected, in the sense of not separating the plane, and have empty interior. For such a set, the identifications between symbolic addresses must be compatible with the uniqueness of arcs. We ask how many evenly spaced maps can produce one.
Theorem 1.1 (Sharp six-map bound). Let be the attractor of (1), and suppose that does not lie in a line. If is a dendrite, then , and for each there are such dendrites. In particular, for every connected of this form contains a simple closed curve, and therefore has interior points or separates the plane.
Dendrites and other tree-like sets are basic models in analysis on fractals. Kigami developed harmonic calculus on limits of networks with dendrites as a principal application [29], and self-similar dendrites such as Hata’s tree-like set are standard examples of postcritically finite self-similar sets [30]. Dendrites also arise as Julia sets: if every critical point of a polynomial is strictly preperiodic, as for , its Julia set is a dendrite [16, 33]. Julia sets of postcritically finite rational maps are topologically self-similar [28], and Laplacians have been constructed on several quadratic Julia sets [24, 36]. For binary systems with a common multiplier and singleton overlap, the attractor carries a folded inverse map; in the postcritically finite case, Eroğlu, Rohde, and Solomyak prove a quasisymmetric conjugacy between this map and a quadratic polynomial on its Julia set [17, Theorem 1.1]. Theorem 1.1 shows that evenly spaced systems with a common non-real multiplier produce such tree-like attractors only when there are at most six maps.
The affine map , with , conjugates (1) to the system , , where and . It carries onto
and lies in a line exactly when is real. We work in this normalization throughout. Write for its connectedness locus. In these terms, Theorem 1.1 states that is a dendrite for some non-real exactly when ; Figure 1 shows one for each such .
Figure 1. Non-real dendrites at all five admissible alphabet sizes, with the exact parameters in (6). Colors and labels identify the first-level pieces of (3), in increasing digit order; white circles mark the contact points . Panels (a)–(e) are drawn at different scales, and panels (f)–(j) magnify the squares in (a)–(e) five times. The point samples illustrate the sets; exact intersection certificates and proofs are given in § 7.
Barnsley and Harrington initiated the parameter-space study of the binary family [8]. They considered the disconnectedness set for a pair of similarities with a common complex multiplier. The connectedness convention and reciprocal change give . Bousch proved connectedness, local connectedness, and Hölder path connectedness of the binary locus [12]. His thesis also treats the consecutive alphabets for every , proving that connectedness is equivalent to overlap between neighboring first-level pieces [11 Chapter 1, p. 41]. An affine change of coordinates identifies these systems with (2). Bandt [3] and Solomyak and Xu [39] developed the study of the binary locus, Shmerkin and Solomyak related zeros of power series to connectedness loci of self-affine sets [37], and Calegari, Koch, and Walker proved Bandt’s conjecture on the binary locus [13]. Espigulé, Juher, and Saldaña [23] investigated the collinear loci uniformly in . When is a non-real quadratic integer with , the set is a planar self-affine tile with a collinear digit set; the connectedness, disklikeness, and topology of such tiles were studied by Kirat and Lau [31], Leung and Lau [32], and Akiyama, Loridant, and Thuswaldner [1]. Bandt and Hung studied the analogous family whose fixed points are the vertices of a regular polygon [5].
The non-real restriction is essential: is an interval, hence a dendrite, for every . Connected self-similar sets are locally connected [25], so the exclusion amounts to forcing a simple closed curve. Finite overlaps are relevant to this problem: Bandt and Rao prove that finite first-level intersections in a connected planar self-similar set imply the open set condition [7]. Self-similar dendrites can nevertheless have nontrivial subdendrites as intersections, even under that condition [2]. Our argument uses the equal spacing of the digits and applies without a separation or finite-intersection hypothesis.
The exclusion follows from a quantitative statement about contacts. Write
so that for . Thus is the common normalized contact between neighboring pieces. Define
Since , equivalently . This counts participating pieces, not points or connected components of .
Theorem 1.2 (Contact multiplicity). Let .
(1) If is a dendrite, then exactly one of and is nonempty, all other sets are empty, and .
(2) If , then
For every , equality is attained at a non-real quadratic parameter. Thus is the exact minimum of over . The sequence is nondecreasing and .
For example, , , , , and . On the imaginary axis every piece participates: whenever (Proposition 5.3).
The proof has two independent parts. Equal digit offsets replicate contacts across consecutive pieces. If two such contacts occur inside a dendrite, their unique arcs produce a forbidden translation parallelogram. Analytically, a sufficiently large first digit forces a small real zero of the corresponding power series. Jensen’s formula then excludes a non-real zero at the required modulus, in the spirit of the estimates of Beaucoup, Borwein, Boyd, and Pinner [9]. Connectivity at a smaller alphabet handles the complementary range of moduli.
The same estimate constrains roots of integer polynomials. For , the description of the connectedness locus through zeros of power series and polynomials with coefficients in is classical [13, 37]. For every , is the closure, outside the closed unit disk, of the set of roots of monic integer polynomials of height at most , that is, with all coefficients in [22 Proposition 2.3]. The closure in of the roots of all integer polynomials of height at most , monic or not, is [22 Proposition 1.1]; in particular, non-monic polynomials add nothing outside the closed unit disk. A root of satisfies , a finite digit expansion of the kind in Lemma 2.1, whose first digit is .
Corollary 1.3 (Subleading coefficients of non-real roots). Let , and let with be a root of a monic polynomial with integer coefficients of absolute value at most . Then . The bound is sharp: for every , some such root has and .
The proof is given in § 6, after Theorem 6.2, because the sharpness examples use the quadratic parameters introduced there.
Since for , the corollary applies in particular to every non-real root with ; for real coefficients of absolute value at most , the same argument gives . For such roots the extreme values are excluded from on, whereas for the construction in the proof of Corollary 1.3 gives non-real roots with and . Since by Lemma 2.1 and on by Proposition 6.1, the non-real points of with , which belong to because is closed in [22 Proposition 2.3], lie in the annulus . There, by Theorem 6.2, every expansion with integer digits has once . Geometrically, the non-real parts of the parameter regions selected by large first digits, and even of their convex relaxations, recede inside the connectedness disk from on; Figure 2 and Figure 3 display these vanishing fronts. In § 6 we determine exactly which first digits occur at non-real parameters outside the connectedness disk, give support-function bounds for the corresponding parameter sets, and use a quadratic family to attain the minimum in Theorem 1.2. Figure 4 shows such a parameter, with and : the pieces and meet and , respectively, while does not meet . In a dendrite, by contrast, the only contact is between and , or and (Theorem 1.2(1)).
Figure 2. Convex first-digit loci for in the first quadrant, in blue against their union in gray; panel (a) shows that union, numbered by how many loci contain each point. The dashed arc is and the thin gray arc is ; white diamonds mark from (25), . The loci overlap near the unit disk, whereas the extreme locus has no non-real part outside the dashed arc. These are numerical renderings of the convex relaxation.
Figure 3. First-quadrant convex first-digit geometry at six alphabet sizes. The bands are level sets of the largest convex-admissible nonnegative label , whose value is printed in each band; the labeled loci themselves overlap. Dark blue marks and lighter blue ; dashed arcs are and thin gray arcs . The upper right corner of each panel gives the largest convex-admissible label at non-real grid points with , namely , as in Theorem 6.2; white diamonds mark (25) with this . Blue extends outside only for .

Figure 4. The attractor and its translate at the parameter of Proposition 6.3, marked by the white diamond in Figure 3(d), with the convex hulls of their first-level pieces; pieces with the same index share a hue. The hulls of and intersect exactly when , because is the only convex-admissible label at (Proposition 6.1 and Theorem 6.2). In particular, the rightmost piece of does not meet the leftmost piece of the translate. By (26), and (white circles), so two pieces of meet ; these four pieces are drawn in full color, the others in light tints. The symmetry about (black dot) exchanges and , maps onto , and swaps and . The point samples are numerical illustrations.
The examples in Figure 1 establish sharpness at the following exact parameters:
Up to affine normalization and complex conjugation, the binary example is the one in [17 Figure 3]. In each case neighboring pieces meet at one point, non-neighboring pieces are disjoint, and the first-level intersection graph is a path. § 7 proves these assertions by finite exact inverse-state calculations. The computations are included in full and can also be reproduced by the accompanying verification program.
Relation to other work
The present classification concerns the possible alphabet sizes; a classification of all dendrite parameters, even at a fixed size, is a finer problem.
Recent work on the same collinear family concerns the geometry of . Espigulé and Juher construct semialgebraic interior layers using finite capture and prove uniform bounds on enclosure-tree branching [22]. A separate paper proves that every non-real point of is a limit of interior points [20], and infinitely many holes of the loci are exhibited in [19]. Here the object of study is the topology of the individual attractor. Our contact count is linked to the inverse search through the replication formula in Lemma 2.2; Remark 5.4 explains the distinction between the number of admissible offsets and the number of pieces they connect. The normalization follows the thesis [18], whose Chapter 3 and Appendix C announce the dendrite classification. The present paper gives the proofs and the sharp minimum contact count.
Connectivity and replicated contacts
We first recall Bousch’s connectedness criterion for consecutive collinear digits [11 Chapter 1, p. 41]. We include a proof together with the separation consequence and the classical connectedness-disk estimate [38 Lemma 2.5], in the form of [23 Proposition 5(i)], needed below. For , put . Digit subtraction gives
Every digit in can be lifted to a pair of digits from ; thus this equality holds in both directions.
Lemma 2.1 (Neighboring contact and separation). For and , the following are equivalent:
(1) is connected;
(2) two distinct first-level pieces intersect;
(3) every neighboring pair of first-level pieces intersects;
(4) for some .
If is disconnected, its first-level pieces are pairwise disjoint. Moreover,
Proof. We use the elementary planar crossing fact that a left-to-right continuum and a bottom-to-top continuum in a rectangle must meet; see, for example, [35 Lemma 7]. The argument below is Bousch’s lemme de coinçage [11 Chapter 1, p. 28]. The same overlap criterion can be obtained from Hopf’s horizontal-chord theorem [26]; see [22 Proposition 2.2 and Lemma A.1].
Let be a continuum and suppose two translates and intersect. Choose the smallest positive index gap giving such an intersection. Suppose that has positive vertical extent and , and let be the bounding rectangle of the continuum . This continuum meets both vertical sides of . The intermediate translate lies in and meets both horizontal sides, because all translates have the vertical extent of . An intersection gives a gap or , a contradiction. Thus . If has zero vertical extent, it is a horizontal interval and the same conclusion follows from its length. Translation invariance then makes all neighboring translates intersect.
To apply this without assuming the attractor connected, let , , and
These compact sets are nested, contain , and converge to . Suppose two actual first-level pieces intersect. Starting with , inductively assume connected. The translates of inherit that intersection, so the preceding crossing argument shows that all neighboring translates meet. Hence is connected. Their nested intersection is therefore connected. Conversely, a connected finite union of nonempty compact pieces cannot have those pieces pairwise disjoint. Applying the crossing argument directly to the connected set proves the equivalence of the first three conditions. The fourth follows from (7), since neighboring contact is equivalent to .
If is disconnected, the established equivalence gives positive distance between every pair of first-level pieces. For sufficiently small , let be the open -neighborhood of . The images are pairwise disjoint, and each lies in , since its points have distance less than from . Taking planar area, which is finite and positive on , gives . Thus , proving (8).
For a connected , each consecutive block is consequently a continuum. This fact will control the arcs used in the topological argument.
Set , the height bound in Corollary 1.3, so that , and introduce the admissible offsets
By Lemma 2.1, this set is nonempty whenever .
The replication of overlaps under equal digit differences already appears in Bousch’s translation symmetries of the overlap graph [11 Chapter 1, p. 38]. The next lemma records this mechanism for the contact and counts the resulting pairs.
Lemma 2.2 (Contact replication). For ,
Each gives exactly intersecting ordered pairs, whose intersection sets are successive translates by . In particular,
and
Proof. An equality , with , is equivalent to . Using (7) gives (2.4). For a fixed $m$, there are exactly $n-|m|$ pairs with $i-j=m$. Incrementing both indices by one translates the intersection by $2$. Their left indices are distinct, which proves (2.6); summation gives {xref}(2.5)`.
The topological obstruction
We use standard properties of dendrites: subcontinua are dendrites; nonempty intersections of subcontinua are connected; each pair of points is joined by a unique arc; and a dendrite is contractible [15].
Lemma 3.1 (Translation parallelogram). Let be a planar dendrite and let be linearly independent over . There are no paths from to and from to such that
all lie in .
Proof. These four paths define a continuous map on the boundary of the unit square, using identical parametrizations on opposite sides. Contractibility of extends it to a continuous map . Extend over the plane by
The prescribed boundary maps agree on shared edges, so is well-defined and continuous. For the invertible real-linear map , the function is periodic and bounded. For any , the map
takes a sufficiently large closed disk into itself. Brouwer’s fixed-point theorem shows that has a solution. Thus is onto. But its image is contained in . A planar dendrite has empty interior, since a disk contains a simple closed curve; its translates are compact and nowhere dense. Baire’s theorem rules out this covering of the plane. □
Proposition 3.2 (One participating piece). If and is a dendrite, then precisely one of
is nonempty, and all other ordered cross-contacts are empty. Consequently .
Proof. The contact is nonempty by Lemma 2.1. For adjacent digits, the union of the corresponding pieces is a subcontinuum of , and is similar to . The latter union is therefore a dendrite. Its subcontinua and have connected intersection .
Suppose and . Choose with and , and take . Replication gives . The unique arc from to lies in , so both and lie in . The unique arc from to lies in the consecutive block
because its endpoints lie in and and is a subcontinuum. The shifted block also lies in , giving . Now apply Lemma 3.1 with
The required vectors are independent because is non-real. This contradiction excludes every nonextreme offset.
Let and . We have . If both sets were nonempty, connectedness of would force . A point of their intersection would lie in , producing the already excluded offset . Thus exactly one extreme contact occurs. A point of in any other left piece would produce an additional cross-contact, so exactly one left piece participates. □
The sharp uniform contact bound
Zeros of power series with real coefficients in were studied by Beaucoup, Borwein, Boyd, and Pinner [9, 10]. Among other results, they show that for the smallest disk containing two zeros has radius , the smallest possible double real zero, and they compute the smallest circle containing a real zero and a pair of conjugate zeros of a given argument [9]. The next lemma adapts these ideas to a prescribed large first coefficient, using only a bound on the remaining coefficients, which need not be integers. Its hypothesis is the integer form of , that is, . For , the series used for sharpness below has the double zero .
Lemma 4.1 (First-coefficient exclusion). Let be an integer and . If
then every zero of in is real.
Proof. Replacing by if necessary, take . Notice that , since for , and . For ,
The numerator has smaller positive root
Since and , there is a positive real zero . Suppose it also has a non-real zero with . Its conjugate is another zero. Set ; all three distinct zeros lie in . Jensen’s formula, followed by the arithmetic–geometric mean inequality and Parseval’s identity, gives
If a zero lies on , obtain the same estimate by a limit through radii avoiding the zeros. On the other hand,
For the last inequality, it suffices that . Its left side is at least . For , subtracting the right side gives 112. For , using and gives
This contradicts (14) and proves the lemma. □
The middle expression in the last display is positive for every ; it equals at and increases with . Hence the same proof applies with replaced by the real number , both in the bound on and in the radius. This threshold cannot be lowered: for real slightly below , the series has a pair of non-real zeros of modulus , which merge at into the double zero .
Proof of Theorem 1.2. Part (1) is Proposition 3.2. For part (2), write and . If , then is connected by Lemma 2.1. It supplies an expansion of with all digits in , hence an admissible first offset with for the -map system. By (12), .
If , take any . Its expansion in (9), multiplied by , makes a zero of a series of the form in Lemma 4.1, with tail coefficients bounded by . As is non-real, that lemma excludes . Thus every admissible offset has , and (12) again gives .
The inequality gives . The increase is less than 1, so the corresponding ceiling increases by at most 1. Hence is nondecreasing. Its asymptotic form follows directly from the ceiling formula. Attainment is proved in Proposition 6.3 below. □
Proof of the exclusion in Theorem 1.1. By the conjugation in § 1, we may assume that with non-real. For the two conclusions of Theorem 1.2 are incompatible with a dendrite. A connected self-similar set is locally connected [25], so a connected attractor that is not a dendrite contains a simple closed curve . If contains the bounded complementary domain of , it has interior points. Otherwise some point of that domain lies outside , and its component in lies inside ; hence separates the plane. □
Remark 4.2 (The role of Jensen’s formula). For the exclusion also follows from elementary estimates. Let be a non-real dendrite parameter and . By Proposition 3.2, is or ; replacing by or , which leaves the attractor unchanged up to a reflection, we may assume that and . Then (15) with gives for , and Proposition 6.1 gives and
The convex function satisfies when . Also for : with , the value decreases for and equals at . Hence on , a contradiction. Lemma 4.1 is therefore needed only for and for the sharp count in Theorem 1.2.
Dependence on the parameter
The uniform estimate can be supplemented by elementary bounds that retain the modulus of or the alphabet size.
Proposition 5.1 (Radial bound). Let and . Then
For one may take the maximum of this bound and .
Proof. If , apply Lemma 2.1 to and then Lemma 2.2. Otherwise the bound is just . □
Proposition 5.2 (Increasing the alphabet). Fix . Then
In particular, writing , one has for . A non-real dendrite can occur only at the first connected alphabet size: .
Proof. The nested balanced digit alphabets give . An offset contributes exactly the left indices
Their union over is precisely the participating-index set. Every old interval is contained in its counterpart at alphabet size . If there is a nonnegative offset, the new index is added. If all offsets are negative, the union is an initial interval, and its endpoint increases by at least one. This proves (16). Iteration gives the bound involving ; the dendrite assertion then follows from Proposition 3.2. □
Proposition 5.3 (Imaginary-axis count). For , is connected if and only if . Throughout that range it is a nondegenerate rectangle and .
Proof. Splitting the digit expansion into even and odd positions gives
The convex hull of is , with . Its first-level intervals cover this hull precisely when , or . In this case their invariant set is the whole interval. If , those intervals are pairwise disjoint, so and hence are disconnected. In the connected case, putting yields
Since , every meets . This includes equality , where is a horizontal segment. □
Remark 5.4 (Branching and contact multiplicity). Put and . For , (9) gives
Thus admissible offsets are precisely the first inverse branches of the marked point that remain in the difference attractor. When , also by Lemma 2.1. Since lies in the canonical enclosure of [22 Section 6.1], each digit with then labels a child of the root in the exact enclosure tree of [22 Definition 6.3]. Theorem E of that paper therefore gives for non-real with , and if or . For and , respectively, these two bounds also follow from Proposition 6.1: when , the admissible offsets lie in a closed interval of length at most . These bounds count offsets. By Lemma 2.2, one offset produces intersecting pairs of original pieces. For example, the even–odd decomposition in Proposition 5.3 gives , while and . Bounded branching is therefore compatible with a contact count that grows with the alphabet size.
First-digit loci and convex parameter geometry
We now express the contact condition in parameter space. Fix , write and , and let be an integer. Recall from (7) that for . The first-digit locus consists of parameters for which some overlap expansion (9) begins with . Replacing the remaining digit choices by their convex hull gives the convex locus :
Equivalently, if and only if
The convexification identity
follows by taking convex hulls of finite digit sums and passing to the Hausdorff limit; see also [11 Chapter 1, p. 42]. Thus is described by (19) with real tail digits , while the first digit remains an integer. By Lemma 2.1,
These sets generally overlap. A disjoint decomposition is obtained by recording the full set of admissible labels: for each nonempty , take the parameters belonging to precisely the loci labeled by . Complex conjugation preserves each label, while exchanges and . Hence there are representative labels up to symmetry in the whole plane; negative labels may still occur in the first quadrant. Figure 2 displays the nonnegative convex loci separately.
Support functions and localization
The convex relaxation has an explicit support description. Put
The sums converge for , and is the support function of the centrally symmetric compact convex set . Consequently
At a fixed parameter, the eligible real first digits form an interval: they are the horizontal section of on the real axis. The convex-admissible integer labels therefore form a consecutive interval, possibly empty. No such interval assertion is needed for the exact labels.
For , the radial enclosure for , and for the large set of expansions with real digits, is a theorem of Beaucoup, Borwein, Boyd, and Pinner [9 Theorem 2], stated there for coefficient bounds ; it is applied to these loci in [23 Proposition 4]. An elementary proof by vertical support, valid for every , is also given in [22 Proposition A.2]. That elementary estimate applies verbatim to the convex relaxation and also localizes each first-digit locus in a vertical strip.
Proposition 6.1 (Radial and strip bounds). If and , then
In particular, the non-real part of with lies in the vertical strip
Proof. Write and use the real-tail expansion in (19). The estimate gives
The second inequality is strict at a non-real parameter, because its sine estimate is strict. Dividing by proves the radial bound. Multiplying the expansion by gives . Its imaginary part gives . Finally, .
For numerical rendering, truncate to . The geometric tail gives
Finite zonotopes and their enlarged supporting half-planes thus give inner and outer membership bounds for the convex relaxation. The figures use this construction on sampled parameter grids; the tail bound is explicit, but the floating-point renderings are not interval certificates. The source code and grid data are among the ancillary files described at the end of the paper.
First digits outside the connectedness disk
The disk estimate in Lemma 2.1 singles out the range for the following classification. For each fixed first digit , both and increase with . The restriction below concerns the portions outside this growing disk and first digits whose magnitude increases with the alphabet size. Since preserves every label and exchanges and , positive labels in the first quadrant are representative; the last assertion of the theorem records the symmetric form.
Theorem 6.2 (First digits outside the connectedness disk). Let . The positive integers for which contains a parameter with , , and are precisely
The same classification holds for . Moreover, if and satisfies , in particular if , then . For every in (24), the exact locus contains the parameter
Consequently, for every integer with , each of the loci and contains a non-real parameter with if and only if .
Proof. For , put . If with , its expansion makes a zero of a series as in Lemma 4.1, with real tail coefficients. When and is non-real, this contradicts that lemma. Hence for every non-real with ; since , this includes the range . For , all positive allowed labels satisfy .
For every label in (24), one has , so (25) is non-real. Its equation gives
These integer tail digits are admissible. Thus , and .
For the final assertion, the exclusion above gives whenever , while for . Conversely, serves for ; for , the map carries into ; and , because the proof of Proposition 5.3 with , so that , gives , whence by Lemma 2.2. Since , the same parameters serve for the convex loci. □
Proof of Corollary 1.3. Put and . The point is a non-real zero of , where . If , by Lemma 4.1, applied with and , shows that every zero of in is real, a contradiction. Hence .
For the constructions, let and let be an integer with . By (26), is a non-real zero of , which converges in the unit disk. The partial sums of converge to locally uniformly there, so Hurwitz’s theorem gives zeros of . The polynomials are monic of height , with subleading coefficient , and have the roots . Since is non-real and , the same holds for when is large. Taking for proves sharpness, and taking for gives non-real roots with and . □
The extreme locus therefore meets the non-real range exactly when . For , the number of positive first digits whose convex loci have no non-real parameter in that range is
This number is nondecreasing; it equals 1, 4, and 11 at , 12, and 21, respectively. Figure 3 shows the transition and the subsequent loss of outer first-digit loci. For , the extreme-label parameter in (25) is exactly the quadratic dendrite example in (6).
Proposition 6.3 (Attainment of the contact bound). For , put and . At the parameter in (25),
In particular, for every ,
Proof. Since , (26) shows that is an admissible label. Also and . The strict estimate
is equivalent to , which follows from and . By Proposition 6.1, every admissible integer label therefore satisfies , hence . For a positive label , the participating left indices are exactly by (10). These intervals are nested, and itself occurs. Their union has indices. Combining this equality with Theorem 1.2 proves the minimum.
Figure 4 illustrates Proposition 6.3 for , at , the white diamond in Figure 3(d).
Confinement and rescaled geometry
All first-digit loci retain a common part near the unit disk. For with , splitting the balanced digits into even and odd positions as in Proposition 5.3 gives
Indeed, since , the digits in even and in odd positions each fill an interval, so the tails fill the rectangle displayed below, and exactly when lies in it. In particular, every label is exactly admissible when . For , the point lies strictly inside the tail rectangle
for every label . Hausdorff continuity of , which follows from (23), then gives a common open intersection of all convex loci, extending into the first quadrant.
First digits comparable to the alphabet size satisfy a stronger radial bound.
Proposition 6.4 (Confinement of large first digits). Let , and let be an integer with . Set
Every non-real satisfies . For any sequence of integers such that , the bound applies for all sufficiently large , and
Proof. The majorant in (13) provides a real zero . If , the zeros , , and lie in , and Jensen and Parseval give , yielding the bound. The remaining case is automatic because makes . If , then for all sufficiently large . Dividing the numerator and denominator in (28) by gives (29). □
Thus, when , the non-real portions of the convex loci remain in a bounded disk while the connectedness disk has radius . Their distances from the origin, after division by , tend uniformly to zero. The constant in (29) is not optimal; a choice of depending on improves it. For , Proposition 6.1 alone gives the better asymptotic bound , because and .
For the portions outside the connectedness disk, shown in Figure 5, set . If and , then Proposition 6.1 gives the explicit inequalities
Figure 5. Convex first-digit loci outside the connectedness disk for , 21, and 100, in the coordinate , shaded by (as in Figure 3) on a common scale. The thin gray arc is the unit circle; the dashed arc and the dotted arc bound the band of (30). The localization (31) explains the narrowing band and the relation between the first digit and the horizontal position.
In particular, uniformly over these parameters and first digits,
The rescaled non-real outer portions therefore concentrate near the unit circle, with their first digits ordered approximately by horizontal position. The estimates describe their location without determining the topology of the individual loci.
Examples at every alphabet size from two to six
We complete the proof of the sharp bound by exhibiting a dendrite at each of the five admissible alphabet sizes. Up to affine normalization and complex conjugation, the binary example is the one in [17 Figure 3]. The calculations below give a self-contained verification of all five contact structures, using integer arithmetic and one rational interval for the binary case.
Proposition 7.1 (Dendrites for ). For each , there is a non-real parameter for which is a dendrite. One may take the upper-half-plane root of
At each of these parameters,
and non-neighboring first-level pieces are disjoint. Thus the first-level intersection graph is a path, with neighboring pieces meeting at the points , .
Proof. Difference expansions and inverse states. Write , , and . An intersection between pieces separated by gives an expansion
Conversely, every such expansion can be lifted coordinatewise to a pair of addresses in , and hence gives an intersection. Its inverse states satisfy
We enumerate the states reachable from while satisfying a strict upper bound on the squared norm; these states play the role of the neighbor maps of Bandt and Graf [4]. In the five cases below, the reachable graphs are finite. Repeatedly deleting vertices with no outgoing edge identifies all infinite admissible paths.
The quadratic examples. Suppose . Represent a state as , where . Since and , its transition and squared norm are
For , respectively, choose . Then . Indeed, if , the required inequality follows from and , both direct integer inequalities. Thus every bounded inverse path has . The following table lists every transition reachable from and from that satisfies this norm bound. Entries specify the digit and successor. A dash means that no successor satisfies the bound. After repeatedly deleting vertices with no outgoing edge, the unique infinite path is
| State | Successors with | |
| 3 | ||
| — | ||
| 4 | ||
| — | ||
| 5 | ||
| — | ||
| 6 | ||
| — | ||
| — |
Table 1.
The state has no successor satisfying the bound for ; for , its only such successor is , which has no successor satisfying the bound. For every , . It follows that has the unique expansion
whereas has none for .
The binary example. For , both critical values of are positive, so has a unique real root . Direct rational evaluation gives . Its other roots are and , and . Hence and . Represent a state as . Its transition is
Its squared modulus is , where
Substitution of the rational interval for gives the following complete list of successors with squared modulus less than 9. Every excluded successor has squared modulus strictly greater than 9.
| State | Successors with squared modulus less than 9 |
| — |
Table 2.
Thus the unique infinite path from has digits , giving
The displayed identity also follows directly from . Contact structure and dendricity. In all five cases the unique difference expansion uses only extreme digits . Each such digit has a unique lift to a pair from , namely or . Therefore the neighboring contact is exactly . The absence of expansions of for proves that non-neighboring pieces are disjoint. Neighboring contact gives connectedness of by Lemma 2.1, and Hata’s theorem gives local connectedness [25]. The first-level intersection graph is a path. Every first-level junction is a cut point separating the pieces on its two sides. A simple closed curve cannot cross such a junction, since a circle minus one point remains connected. Consequently every simple closed curve in would lie in a single first-level piece. Repeating inside that piece traps the curve in nested cylinders of diameter tending to zero, a contradiction. Hence is a dendrite; compare the criterion of Bandt and Keller [6]. □
Further questions
For , it remains to classify the dendrite parameters and their possible contact sets. With , Proposition 3.2 locates every non-real dendrite parameter in
with the first-digit loci of § 6. The condition counts participating pieces; it does not assert that the contact is a singleton. For , a singleton contact makes a connected attractor a dendrite, by the argument at the end of § 7 (compare [6]). The converse fails, so the equivalence stated in [17 Section 1] holds only in the forward direction. For real with , the attractor is an arc whose two pieces overlap in an interval. For a non-real example, take , where is the root of in [14 Example 3.8]. The equation for is equivalent to , so the two first-level pieces share a fifth-level piece. Calegari and Walker note that this piece is their entire intersection and that the attractor is a dendrite. It would be useful to determine which non-singleton contacts occur at the other admissible alphabet sizes.
For , the exact minimum is known, but its full set of attaining parameters remains to be described. The first-digit loci also raise questions about the topology of their incidence strata and the difference between exact membership and convex relaxation. The quadratic parameters and support estimates in § 6 give explicit starting points.
The proofs use both the common linear part and the equal spacing of the fixed points; equal spacing drives the replication of contacts in Lemma 2.2. It would be interesting to know whether collinear systems with a common non-real multiplier but unevenly spaced fixed points can produce dendrites with seven or more maps.
Acknowledgments
The author thanks David Juher and Joan Saldaña for discussions on collinear self-similar sets. The research program was supported by project PID2023-146424NB-I00, funded by MICIU/AEI/10.13039/501100011033 and ERDF/EU, and by the Universitat de Girona and Banco Santander Grant Programme for Researchers in Training (IFUdG 2022–2024).
Computational materials
The exact-arithmetic verifier for the tables in § 7 (which uses only the Python standard library), the figure programs, and the sampled parameter data are available as ancillary files with the arXiv version of this article. The Collinear Fractals explorer [21] provides interactive views of the attractors and connectedness loci:
https://complextrees.com/collinear-fractals-gpu/.
Use of artificial intelligence
ChatGPT (OpenAI) assisted in developing and checking the proofs in § 3, § 4, and § 6, preparing the verification and visualization code, and drafting and revising the manuscript. Claude (Anthropic) assisted in checking the proofs, computations, and references, in drafting and revising parts of the text, including Corollary 1.3 and Remark 4.2, and in preparing Figure 4. The author is responsible for the mathematical content.
References
DEPARTMENT D’INFORMÀTICA, MATEMÀTICA APLICADA I ESTADÍSTICA, UNIVERSITAT DE GIRONA, 17003 GIRONA, CATALONIA, SPAIN
Email address: [email protected]
References
- [1]S. Akiyama, B. Loridant, and J. M. Thuswaldner, Topology of planar self-affine tiles with collinear digit set, J. Fractal Geom. 8 (2021), 53–93. doi: 10.4171/JFG/98.DOI
- [2]K. Allabergenova, M. Samuel, and A. Tetenov, Intersections of the pieces of self-similar dendrites in the plane, Chaos Solitons Fractals 182 (2024), 114805. doi: 10.1016/j.chaos.2024.114805.DOI
- [3]C. Bandt, On the Mandelbrot set for pairs of linear maps, Nonlinearity 15 (2002), 1127–1147. doi: 10.1088/0951-7715/15/4/309.DOI
- [4]C. Bandt and S. Graf, Self-similar sets 7. A characterization of self-similar fractals with positive Hausdorff measure, Proc. Amer. Math. Soc. 114 (1992), 995–1001. doi: 10.1090/S0002-9939-1992-1100644-3.DOI
- [5]C. Bandt and N. V. Hung, Fractal n-gons and their Mandelbrot sets, Nonlinearity 21 (2008), 2653–2670. doi: 10.1088/0951-7715/21/11/009.DOI
- [6]C. Bandt and K. Keller, Self-similar sets 2. A simple approach to the topological structure of fractals, Math. Nachr. 154 (1991), 27–39. doi: 10.1002/mana.19911540104.DOI
- [7]C. Bandt and H. Rao, Topology and Hausdorff measure of self-similar fractals in the plane, Nonlinearity 20 (2007), 1463–1474. doi: 10.1088/0951-7715/20/6/008.DOI
- [8]M. F. Barnsley and A. N. Harrington, A Mandelbrot set for pairs of linear maps, Physica D 15 (1985), 421–432. doi: 10.1016/S0167-2789(85)80008-7.DOI
- [9]F. BeaucouP, P. Borwein, D. W. Boyd, and C. Pinner, Power series with restricted coefficients and a root on a given ray, Math. Comp. 67 (1998), 715–736. doi: 10.1090/S0025-5718-98-00960-0.DOI
- [10]F. BeaucouP, P. Borwein, D. W. Boyd, and C. Pinner, Multiple roots of [−1, 1] power series, J. London Math. Soc. (2) 57 (1998), 135–147. doi: 10.1112/S0024610798005857.DOI
- [11]T. Bousch, Sur quelques problèmes de dynamique holomorphe, doctoral thesis, Université Paris-Sud, Orsay, 1992. Author’s electronic edition.
- [12]T. Bousch, Connexité locale et par chemins höldériens pour les systèmes itérés de fonctions, unpublished manuscript, 1993; version of 5 January 1996. Author’s electronic edition.
- [13]D. Calegari, S. Koch, and A. Walker, Roots, Schottky semigroups, and a proof of Bandt’s conjecture, Ergodic Theory Dynam. Systems 37 (2017), 2487–2555. doi: 10.1017/etds.2016.17.DOI
- [14]D. Calegari and A. Walker, Laminations and external angles for similarity pairs, preprint, 2026. arXiv:2608.12774v1.arxiv.org/abs/2608.12774
- [15]J. J. Charatonik and W. J. Charatonik, Dendrites, Aportaciones Mat. Comun. 22 (1998), 227–253.
- [16]A. Douady and J. H. Hubbard, Étude dynamique des polynômes complexes. Partie I, Publications Mathématiques d’Orsay 84-2, Université Paris-Sud, Orsay, 1984; Partie II, Publications Mathématiques d’Orsay 85-4, 1985.
- [17]K. I. Eroğlu, S. Rohde, and B. Solomyak, Quasisymmetric conjugacy between quadratic dynamics and iterated function systems, Ergodic Theory Dynam. Systems 30 (2010), 1665–1684. doi: 10.1017/S0143385709000789.DOI
- [18]B. Espigulé Pons, Collinear fractals and connectedness loci: topology, finite capture, and restricted polynomial roots, doctoral thesis, Universitat de Girona, 2026.
- [19]B. Espigulé, Infinitely many holes in connectedness loci for collinear affine iterated function systems, preprint, 2026. arXiv:2606.01467v1.arxiv.org/abs/2606.01467
- [20]B. Espigulé, Regular closedness off the real axis for root closures of bounded-height integer polynomials, preprint, 2026. arXiv:2610.38971v1.arxiv.org/abs/2610.38971
- [21]B. Espigulé, Collinear Fractals GPU: companion software for collinear fractals, finite capture, and restricted polynomial roots, version 0.2.0-alpha, 2026 [software]. Software release.
- [22]B. Espigulé and D. Juher, Semialgebraic interior layers in root closures of bounded-height integer polynomials, preprint, 2026. arXiv:2603.07397v2.arxiv.org/abs/2603.07397
- [23]B. Espigulé, D. Juher, and J. Saldaña, Collinear fractals and Bandt’s conjecture, Fractal Fract. 8 (2024), 725. doi: 10.3390/fractalfract8120725.DOI
- [24]T. C. Flock and R. S. Strichartz, Laplacians on a family of quadratic Julia sets I, Trans. Amer. Math. Soc. 364 (2012), 3915–3965. doi: 10.1090/S0002-9947-2012-05398-0.DOI
- [25]M. Hata, On the structure of self-similar sets, Japan J. Appl. Math. 2 (1985), 381–414. doi: 10.1007/BF03167083.
- [26]H. Hopf, Über die Sehnen ebener Kontinuen und die Schleifen geschlossener Wege, Comment. Math. Helv. 9 (1936), 303–319. doi: 10.1007/BF01258195.DOI
- [27]J. E. Hutchinson, Fractals and self-similarity, Indiana Univ. Math. J. 30 (1981), 713–747. doi: 10.1512/iumj.1981.30.30055.DOI
- [28]A. Kameyama, Julia sets of postcritically finite rational maps and topological self-similar sets, Nonlinearity 13 (2000), 165–188. doi: 10.1088/0951-7715/13/1/308.DOI
- [29]J. Kigami, Harmonic calculus on limits of networks and its application to dendrites, J. Funct. Anal. 128 (1995), 48–86. doi: 10.1006/jfan.1995.1023.DOI
- [30]J. Kigami, Analysis on Fractals, Cambridge Tracts in Mathematics 143, Cambridge University Press, Cambridge, 2001. doi: 10.1017/CBO9780511470943.DOI
- [31]I. Kirat and K.-S. Lau, On the connectedness of self-affine tiles, J. London Math. Soc. (2) 62 (2000), 291–304. doi: 10.1112/S002461070000106X.DOI
- [32]K.-S. Leung and K.-S. Lau, Disjointness of planar self-affine tiles, Trans. Amer. Math. Soc. 359 (2007), 3337–3355. doi: 10.1090/S0002-9947-07-04106-2.DOI
- [33]J. Milnor, Dynamics in One Complex Variable, 3rd ed., Annals of Mathematics Studies 160, Princeton University Press, Princeton, NJ, 2006. doi: 10.1515/9781400835539.
- [34]S. B. Nadler, Jr., Continuum Theory: An Introduction, Monographs and Textbooks in Pure and Applied Mathematics 158, Marcel Dekker, New York, 1992.
- [35]A. Pascaletti and F. Zanolin, A crossing lemma for annular regions and invariant sets with an application to planar dynamical systems, J. Math. 2013 (2013), 267393. doi: 10.1155/2013/267393.
- [36]L. G. Rogers and A. Teplyaev, Laplacians on the basilica Julia set, Commun. Pure Appl. Anal. 9 (2010), 211–231. doi: 10.3934/cpaa.2010.9.211.DOI
- [37]P. Shmerkin and B. Solomyak, Zeros of {−1, 0, 1} power series and connectedness loci for self-affine sets, Experiment. Math. 15 (2006), 499–511. doi: 10.1080/10586458.2006.10128977.DOI
- [38]B. Solomyak, Measure and dimension for some fractal families, Math. Proc. Cambridge Philos. Soc. 124 (1998), 531–546. doi: 10.1017/S0305004198002680.DOI
- [39]B. Solomyak and H. Xu, On the “Mandelbrot set” for a pair of linear maps and complex Bernoulli convolutions, Nonlinearity 16 (2003), 1733–1749. doi: 10.1088/0951-7715/16/5/311.DOI



