相关论文: On postcritically finite polynomials, part 2: Hubb…

We consider the problem of classifying the dynamics of complex polynomials $f: \mathbb{C} \to \mathbb{C}$ restricted to their basins of infinity. We synthesize existing combinatorial tools --- tableaux, trees, and laminations --- into a new…

Based on decision trees, many fields have arguably made tremendous progress in recent years. In simple words, decision trees use the strategy of "divide-and-conquer" to divide the complex problem on the dependency between input features and…

We discuss the dynamic and structural properties of polynomial semigroups, a natural extension of iteration theory to random (walk) dynamics, where the semigroup $G$ of complex polynomials (under the operation of composition of functions)…

We present a method to compute finite index subgroups of $PSL_2(\mathbb{Z})$. Our strategy follows Kulkarni's ideas, the main contribution being a recursive method to compute bivalent trees and their automorphism group. As a concrete…

We consider finite range Gibbs fields and provide a purely combinatorial proof of the exponential tree decay of semi--invariants, supposing that the logarithm of the partition function can be expressed as a sum of suitable local functions…

In this paper we investigate the use of staged tree models for discrete longitudinal data. Staged trees are a type of probabilistic graphical model for finite sample space processes. They are a natural fit for longitudinal data because a…

Mating is an operation that identifies the domains of a polynomial pair in order to obtain a new map on the resulting quotient space. The dynamics of the mating are then dependent on the two polynomials and the manner in which the quotient…

We provide isomorphism results for Hopf algebras that are obtained as graded twistings of function algebras on finite groups by cocentral actions of cyclic groups. More generally , we also consider the isomorphism problem for…

One of the fundamental properties of the Mandelbrot set is that the set of postcritically finite parameters is structured like a tree. We extend this result to the set of quadratic kneading sequences and show that this space contains no…

The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…

Let $k$ be a number field with algebraic closure $\bar{k}$, and let $S$ be a finite set of places of $k$ containing all the archimedean ones. Fix $d\geq 2$ and $\alpha \in \bar{k}$ such that the map $z\mapsto z^d+\alpha$ is not…

Highly efficient and even nearly optimal algorithms have been developed for the classical problem of univariate polynomial root-finding (see, e.g., \cite{P95}, \cite{P02}, \cite{MNP13}, and the bibliography therein), but this is still an…

Using tools from computable analysis we develop a notion of effectiveness for general dynamical systems as those group actions on arbitrary spaces that contain a computable representative in their topological conjugacy class. Most natural…

We investigate the dynamics of semigroups generated by a family of polynomial maps on the Riemann sphere such that the postcritical set in the complex plane is bounded. The Julia set of such a semigroup may not be connected in general. We…

This continues the investigation of a combinatorial model for the variation of dynamics in the family of rational maps of degree two, by concentrating on those varieties in which one critical point is periodic. We prove some general results…

In this paper we study a class of dynamical systems generated by iterations of multivariate polynomials and estimate the degreegrowth of these iterations. We use these estimates to bound exponential sums along the orbits of these dynamical…

This paper presents a framework for abstracting uncertain or non-polynomial components of dynamical systems using polynomial constraints. This enables the application of polynomial-based analysis tools, such as sum-of-squares programming,…

This paper describes techniques for growing classification and regression trees designed to induce visually interpretable trees. This is achieved by penalizing splits that extend the subset of features used in a particular branch of the…

Linear finite dynamical systems play an important role, for example, in coding theory and simulations. Methods for analyzing such systems are often restricted to cases in which the system is defined over a field %and usually strive to…

The paper deals with Newton maps of complex exponential functions and a surgery tool developed by P. Ha\"issinsky. The concept of "Postcritically minimal" Newton maps of complex exponential functions are introduced, analogous to…