Random complex dynamics and devil's coliseums

We investigate the random dynamics of polynomial maps on the Riemann sphere and the dynamics of semigroups of polynomial maps on the Riemann sphere. In particular, the dynamics of a semigroup $G$ of polynomials whose planar postcritical set is bounded and the associated random dynamics are studied. In general, the Julia set of such a $G$ may be disconnected. We show that if $G$ is such a semigroup, then regarding the associated random dynamics, the chaos of the averaged system disappears in the $C^{0}$ sense, and the function $T_{\infty}$ of probability of tending to $\infty$ is H\"{o}lder continuous on the Riemann sphere and varies only on the Julia set of $G$. Moreover, the function $T_{\infty}$ has a kind of monotonicity. It turns out that $T_{\infty}$ is a complex analogue of the devil's staircase, and we call $T_{\infty}$ a "devil's coliseum." We investigate the details of $T_{\infty}$ when $G$ is generated by two polynomials. In this case, $T_{\infty}$ varies precisely on the Julia set of $G$, which is a thin fractal set. Moreover, under this condition, we investigate the pointwise H\"{o}lder exponents of $T_{\infty}$ by using some geometric observations, ergodic theory, potential theory and function theory. In particular, we show that for almost every point $z$ in the Julia set of $G$ with respect to an invariant measure, $T_{\infty}$ is not differentiable at $z.$ We find many new phenomena of random complex dynamics which cannot hold in the usual iteration dynamics of a single polynomial, and we systematically investigate them.Comment: Published in Nonlinearity 28 (2015) 1135-1161. See also http://www.math.sci.osaka-u.ac.jp/~sumi

Vector Reachability Problem in SL(2,Z)\mathrm{SL}(2,\mathbb{Z})

The decision problems on matrices were intensively studied for many decades as matrix products play an essential role in the representation of various computational processes. However, many computational problems for matrix semigroups are inherently difficult to solve even for problems in low dimensions and most matrix semigroup problems become undecidable in general starting from dimension three or four. This paper solves two open problems about the decidability of the vector reachability problem over a finitely generated semigroup of matrices from $\mathrm{SL}(2,\mathbb{Z})$ and the point to point reachability (over rational numbers) for fractional linear transformations, where associated matrices are from $\mathrm{SL}(2,\mathbb{Z})$. The approach to solving reachability problems is based on the characterization of reachability paths between points which is followed by the translation of numerical problems on matrices into computational and combinatorial problems on words and formal languages. We also give a geometric interpretation of reachability paths and extend the decidability results to matrix products represented by arbitrary labelled directed graphs. Finally, we will use this technique to prove that a special case of the scalar reachability problem is decidable

On the 3-state Mealy Automata over an m-symbol Alphabet of Growth Order [ n ^{{\log n}/{2 \log m}} ]

We consider the sequence ${J_m,m \ge 2}$ of the 3-state Mealy automata over an m-symbol alphabet such that the growth function of $J_m$ has the intermediate growth order $[n ^{{\log n}/{2 \log m}} ]$. For each automaton $J_m$ we describe the automaton transformation monoid $S_{J_m}$, defined by it, provide generating series for the growth functions, and consider primary properties of $S_{J_m}$ and $J_m$.Comment: 38 pages, 5 Postscript figure

The omega-inequality problem for concatenation hierarchies of star-free languages

The problem considered in this paper is whether an inequality of omega-terms is valid in a given level of a concatenation hierarchy of star-free languages. The main result shows that this problem is decidable for all (integer and half) levels of the Straubing-Th\'erien hierarchy