Contact multiplicity and a sharp six-map bound for collinear self-similar dendrites

arXiv:2611.01291 · math.DS, math.MG, math.NT · Submitted 2026-10-31 · Read on arXiv

math.DS, math.MG, math.NT

Submitted: 2026-10-31

Updated: 2026-10-31

Comments: 20 pages, 5 figures. Ancillary files: exact-arithmetic verifier, figure programs and parameter-grid data

License: http://creativecommons.org/licenses/by/4.0/

The gist: Let K C be the attractor of n at least2 similarities z λz+b k, 0<λ<1, whose fixed points are evenly spaced on a line, and suppose that K does not lie in a line.

Terminology

Abstract

Let K C be the attractor of n at least2 similarities z λz+b k, 0<λ<1, whose fixed points are evenly spaced on a line, and suppose that K does not lie in a line. We prove that K can be a dendrite only if n at most6, and that such dendrites exist for every 2 at most n at most6; no separation or finite-intersection hypothesis is imposed. Hence, for n at least7, every connected K of this kind has interior points or separates the plane. Neighboring pieces of K meet in similar copies of a single contact set. In a dendrite exactly one first-level piece meets this set, whereas for n at least7 at least n- 2 sqrt n-1 at least2 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 z t+z/c, t in-n+1,-n+3,,n-1, the connectedness locus is the closure, outside the unit disk, of the roots of monic integer polynomials of height at most n-1. The same estimate shows that, for n at least7, every such polynomial with a non-real root c satisfying c 2 at least 2 sqrt n-1 +1 has subleading coefficient of absolute value at most 2 sqrt n-1, and that this bound is sharp. Accordingly, for n at least7, at every non-real boundary point c of the locus with c>1, each expansion c= sum j at least0d jc-j with integer digits d j at most n-1 has d 0 at most 2 sqrt n-1.

Sources

Related papers