Related papers: Rigidity and Flexibility of Polynomial Entropy

Any continuous curve in a higher dimensional space can be considered a trajectory that can be parameterized by a single variable, usually taken as time. It is well known that a continuous curve can have a fractional dimensionality, which…

We study ergodic properties of a family of traffic maps acting in the space of bi-infinite sequences of real numbers. The corresponding dynamics mimics the motion of vehicles in a simple traffic flow, which explains the name. Using…

In this article, we develop a functional-analytic framework to establish existence, uniqueness, regularity of disintegration, and statistical properties of equilibrium states for a broad class of dynamical systems, potentially discontinuous…

We consider some smooth maps on a bouquet of circles. For these maps we can compute the number of fixed points, the existence of periodic points and an exact formula for topological entropy. We use Lefschetz fixed point theory and actions…

Poincare return maps are a fundamental tool for analyzing periodic orbits in hybrid dynamical systems, including legged locomotion, power electronics, and other cyber-physical systems with switching behavior. The Poincare return map…

We study topological entropy of exactly Devaney chaotic maps on totally regular continua, i.e. on (topologically) rectifiable curves. After introducing the so-called P-Lipschitz maps (where P is a finite invariant set) we give an upper…

The maximum entropy principle (MEP) is a method for obtaining the most likely distribution functions of observables from statistical systems, by maximizing entropy under constraints. The MEP has found hundreds of applications in ergodic and…

We consider the one-parameter family of interval maps arising from generalized continued fraction expansions known as alpha-continued fractions. For such maps, we perform a numerical study of the behaviour of metric entropy as a function of…

The entropy of a digraph is a fundamental measure which relates network coding, information theory, and fixed points of finite dynamical systems. In this paper, we focus on the entropy of undirected graphs. We prove that for any integer $k$…

It is known that unstable periodic orbits of a given map give information about the natural measure of a chaotic attractor. In this work we show how these orbits can be used to calculate the density function of the first Poincar\'e returns.…

The entropy of a graph is an information-theoretic quantity which expresses the complexity of a graph \cite{DM1,M}. After Shannon introduced the definition of entropy to information and communication, many generalizations of the entropy…

In this work we will show that the Teichm\"{u}ller distance for all elements of a certain class of generalized polynomial-like maps (the class of off-critically hyperbolic generalized polynomial-like maps) is actually a distance, as in the…

We consider a one-parameter family of expanding interval maps $\{T_{\alpha}\}_{\alpha \in [0,1]}$ (japanese continued fractions) which include the Gauss map ($\alpha=1$) and the nearest integer and by-excess continued fraction maps…

We show the existence of Shilnikov-type dynamics and bifurcation behaviour in general discrete three-dimensional piecewise smooth maps and give analytical results for the occurence of such dynamical behaviour. Our main example in fact shows…

A classical problem in dynamical systems is to measure the complexity of a map in terms of their orbits. One of the main tools we have to achieve this goal is entropy. However, many interesting families of dynamical systems have every…

For a class of piecewise hyperbolic maps in two dimensions, we propose a combinatorial definition of topological entropy by counting the maximal, open, connected components of the phase space on which iterates of the map are smooth. We…

In this note, we study a family of polynomials that appear naturally when analysing the characteristic functions of the one-dimensional elephant random walk. These polynomials depend on a memory parameter $p$ attached to the model. For…

We study rigidity of rational maps that come from Newton's root finding method for polynomials of arbitrary degrees. We establish dynamical rigidity of these maps: each point in the Julia set of a Newton map is either rigid (i.e. its orbit…

We give an example of a sequential dynamical system consisting of intermittent-type maps which exhibits loss of memory with a polynomial rate of decay. A uniform bound holds for the upper rate of memory loss. The maps may be chosen in any…

Let $f$ be a piecewise continuous and monotonic map on the interval with at most finitely many discontinuities and turning points. In this paper we study properties about this class of maps and show its main difference from the continuous…