The order structure of forts iterated by quadratic polynomials (Q2142574)

The authors study how non-monotone points, namely forts, occur by iteration. They introduce a partial order, actually a tree structure, on the set of all forts iterated by a quadratic polynomial, which makes every fort coded by a finite 0-1 sequence. They generate forts through iteration by studying some combinatorial properties. Let \(S(g_{\mu})\) denote the set of all forts of \(g_{\mu}(x)=x^{2}+\mu\) and suppose that \(\mathbb{S}_{g_{\mu}} = \bigcup_{k=1}^{\infty}S(g_{\mu}^{k})\). By assigning to every possible fort a code which manifests its generative relation, all forts are classified and ordered, and thus structured. The tree of forts of \(g_{\mu}\) is given as \((\mathbb{S}_{g_{\mu}}, \prec)\). The authors investigate the set of all forts equipped with this partial order, which is a tree structure that can tell not only their generative relation but also their natural order on the real line. Let \(\mathbb{T}\) be a set of codes. A partial order \((\mathbb{T}, \prec)\) is called a tree. The tree of codes of \(g_{\mu}\) is denoted by \(\mathbb{T}_{g_{\mu}}\). Denote by \(\mathbb{T}^{*}\) the complete binary tree. The authors prove that there exists \(\mu^{*}<0\) such that when \(\mu\leq \mu^{*}\), \(\mathbb{T}_{g_{\mu}}=\mathbb{T}^{*}\). Using an operation called ``cutting of a tree'', the authors derive several properties for the set of forts iterated by a quadratic polynomial. The tree structure is highly asymmetrical. The authors present results in the form of a theorem, for which we refer to the paper.