Related papers: Rigidity and Flexibility of Polynomial Entropy

We derive an algorithm to determine recursively the lap number (minimal number of monotone pieces) of the iterates of unimodal maps of an interval with free end-points. The algorithm is obtained by the sign analysis of the itineraries of…

We introduce a new one-variable polynomial invariant of graphs, which we call the skew characteristic polynomial. For an oriented simple graph, this is just the characteristic polynomial of its anti-symmetric adjacency matrix. For…

According to a previous conjecture, spatial and temporal Lyapunov exponents of chaotic extended systems can be obtained from derivatives of a suitable function: the entropy potential. The validity and the consequences of this hypothesis are…

Measuring the average information that is necessary to describe the behaviour of a dynamical system leads to a generalization of the Kolmogorov-Sinai entropy. This is particularly interesting when the system has null entropy and the…

We extend the results of our 2020 paper in the Annali della Scuola Normale Superiore di Pisa, Classe di Scienze. There, we associated to each of an infinite family of triangle Fuchsian groups a one-parameter family of continued fraction…

We prove a rigidity property in non-Archimedean dynamics, reminiscent of Zdunik theorem in complex dynamics: every rational map whose equilibrium measure charges an interval in the Berkovich projective line is affine Bernoulli. Our proof is…

We give an effective method to compute the entropy for polynomials orthogonal on a segment of the real axis that uses as input data only the coefficients of the recurrence relation satisfied by these polynomials. This algorithm is based on…

Chaotic dynamics can be effectively studied by continuation from an anti-integrable limit. We use this limit to assign global symbols to orbits and use continuation from the limit to study their bifurcations. We find a bound on the…

We prove that the polynomial entropy of an orientation preserving homeomorphism of the circle equals 1 when the homeomorphism is not conjugate to a rotation and that it is 0 otherwise. In a second part we prove that the polynomial entropy…

We investigate the multiplier rigidity problem for polynomial automorphisms of $\mathbf{C}^2$. A first result states that a complex H\'enon map of given degree is determined up to finitely many choices by its multiplier spectrum, or more…

A Dirichlet polynomial $d$ in one variable ${\mathcal{y}}$ is a function of the form $d({\mathcal{y}})=a_n n^{\mathcal{y}}+\cdots+a_22^{\mathcal{y}}+a_11^{\mathcal{y}}+a_00^{\mathcal{y}}$ for some $n,a_0,\ldots,a_n\in\mathbb{N}$. We will…

One dimensional intermittent maps with stretched exponential separation of nearby trajectories are considered. When time goes infinity the standard Lyapunov exponent is zero. We investigate the distribution of $\lambda_{\alpha}=…

We consider the long time behavior of the trajectories of the discontinuous analog of the standard Chirikov map. We prove that for some values of parameters all the trajectories remains bounded for all time. For other set of parameters we…

The core entropy of polynomials, recently introduced by W. Thurston, is a dynamical invariant which can be defined purely in combinatorial terms, and provides a useful tool to study parameter spaces of polynomials. The theory of core…

In this study, a theory analogous to both the theories of polynomial-like mappings and Smale's real horseshoes is developed for the study of the dynamics of mappings of two complex variables. In partial analogy with polynomials in a single…

Motivated by robotic surveillance applications, this paper studies the novel problem of maximizing the return time entropy of a Markov chain, subject to a graph topology with travel times and stationary distribution. The return time entropy…

Transitivity, the existence of periodic points and positive topological entropy can be used to characterize complexity in dynamical systems. It is known that for graphs that are not trees, for every $\varepsilon>0,$ there exist (complicate)…

For any discrete time dynamical system with a rational evolution, we define an entropy, which is a global index of complexity for the evolution map. We analyze its basic properties and its relations to the singularities and the…

We prove that multimodal maps with an absolutely continuous invariant measure have exponential return time statistics around a.e. point. We also show a `polynomial Gibbs property' for these systems, and that the convergence to the entropy…

Let f:E -> E be a homeomorphism of the plane E. We define open sets P, called {\em pruning fronts} after the work of Cvitanovi\'c, for which it is possible to construct an isotopy H: E x [0,1] -> E with open support contained in the union…