Related papers: Continuity of core entropy of quadratic polynomial…

The entanglement entropy of a subsystem of a quantum system is expressed, in the replica approach, through analytic continuation with respect to n of the trace of the n-th power of the reduced density matrix. This trace can be thought of as…

In this work a new strategy is proposed in order to build analytic and microscopic models of fluctuating polymer rings subjected to topological constraints. The topological invariants used to fix these constraints belong to a wide class of…

This paper studies polynomials with core entropy zero. We give several characterizations of polynomials with core entropy zero. In particular, we show that a degree d post-critically finite polynomial f has core entropy zero if and only if…

This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…

The no invariant line fields conjecture is one of the main outstanding problems in traditional complex dynamics. In this paper we consider non-autonomous iteration where one works with compositions of sequences of polynomials with suitable…

We define a family of discontinuous maps on the circle, called Bowen-Series-like maps, for geometric presentations of surface groups. The family has $2N$ parameters, where $2N$ is the number of generators of the presentation. We prove that…

For certain typical perturbations $(f_n)_n$ of a rational map $f$ with parabolic cycles, we investigate the relations between the Hausdorff convergence of Julia sets and invariant rays, and the horocyclic convergence of multipliers of…

In connection with the Entropy Conjecture it is known that the topological entropy of a continuous graph map is bounded from below by the spectral radius of the induced map on the first homology group. We show that in the case of a…

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…

Complex 1-variable polynomials with connected Julia sets and only repelling periodic points are called \emph{dendritic}. By results of Kiwi, any dendritic polynomial is semi-conjugate to a topological polynomial whose topological Julia set…

According to the Thurston No Wandering Triangle Theorem, a branching point in a locally connected quadratic Julia set is either preperiodic or precritical. Blokh and Oversteegen proved that this theorem does not hold for higher degree Julia…

Measure-theoretic slow entropy is a more refined invariant than the classical measure-theoretic entropy to characterize the complexity of dynamical systems with subexponential growth rates of distinguishable orbit types. In this paper we…

We compare real and complex dynamics for automorphisms of rational surfaces that are obtained by lifting \chg{some} quadratic birational maps of the plane. In particular, we show how to exploit the existence of an invariant cubic curve to…

We revisit textbook claims that entropy must increase and show that, under time-reversal invariant microscopic dynamics, no universal trajectory-wise or statistical assertion that the coarse-grained entropy $S(t)$ is non-decreasing can…

We study nontrivial entropy invariants in the class of parabolic flows on homogeneous spaces, quasi-unipotent flows. We show that topological complexity (ie, slow entropy) can be computed directly from the Jordan block structure of the…

The u-invariant of a field is the supremum of the dimensions of anisotropic quadratic forms over the field. We define corresponding u-invariants for hermitian and generalised quadratic forms over a division algebra with involution in…

This is a continuation of the series of notes on the dynamics of quadratic polynomials. We show the following Rigidity Theorem: Any combinatorial class contains at most one quadratic polynomial satisfying the secondary limbs condition with…

This note is an introduction to the properties of stable polynomials in several variables with real or complex coefficients. These polynomials are defined in terms of where the polynomial is non-vanishing. We do not cover well-known topics…

We study the polynomial entropy of the wandering part of any invertible dynamical system on a compact metric space. As an application we compute the polynomial entropy of Brouwer homeomorphisms (fixed point free orientation preserving…

The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size, and its roots are called {\em independence roots}. We investigate the stability of such polynomials, that is, conditions…