Our systems of study are families of self-similar sets parameterized by one complex variable. The internal structure of these self-similar sets is illustrated by what we call complex trees. The main advantage of introducing the notion of complex tree is that it gives us a novel way to illustrate and study the parameter spaces in of families of self-similar sets. Not all parameter space maps are used for the same purpose. Some maps are designed to highlight the boundary between two regions. Others may show a particular watershed of related polynomial roots, or they may show the hierarchical distribution of roots, densities, -ary entropy, or other things over a particular area of the parameter space of the family of study. Which of these maps would you like to explore, improve, and generalize?
Media
The connectivity locus for 2-gon complex trees turns out to be the closure of all roots (contained in the unit disk) of polynomials with coefficients 1, -1, and 0, starting always with 1. The map below shows all roots of such polynomials up to degree 12. The radius and color coding of each algebraic number comes from the degree of the lowest degree polynomial who has it as a root.
“THE BEAUTY OF ROOTS by Bernat Espigulé” (http://gallery.bridgesmathart.org/exhibitions/2019-icerm-illustrating-mathematics/geonat)
If we select only roots of polynomials with coefficients equal to 1 or -1 then we obtain a subset of M which is tightly connected to the Thurston Set introduced in Bill Thurston’s last paper.
Root connectivity set M_0 for 2-gon complex trees T{c,-c} Mathematica plot by Bernat Espigulé, Universitat de Barcelona, 03-03-2018Bill Thurston presenting M, M_0, and the Thurston Set, Jackfest 2011. See “Structure of Entropy: The hidden dimensions” at http://www.math.stonybrook.edu/jackfest/Jackfest-2011/Videos/Thurston/Internal structure of M illustrated by complex trees’ piece-to-piece connectivity roots, 20182-gon complex tree with a pair of intersecting points encoded by the following branch path pairs: 122212121…~2112121212… and 11121212..~2221212121…
From these tip-to-tip equivalence relations we can jump to a pair of new families of connected self-similar sets:
Plane-filling binary complex tree encoded by a pair of algebraic numbers
This tree is present in both families obtained from 122212121…~2112121212… and 11121212..~2221212121… We can think of such trees as intersection points between families. New plane-filling complex trees are being unveiled using this reasoning. Creating detailed maps showing where topological changes take place for families of complex trees provides a valuable piece of information. Such maps help us understand the relation between certain algebraic numbers and tip-to-tip equivalence relations of complex trees:
Map of topological changes in black for a family of ternary complex trees, T{z,½,1/(4z)}
Abstract
