Related papers: Polynomial entropy of induced maps of circle and i…

We compute the polynomial entropy of $C(f)$ where $f$ is any circle homeomorphism.

We use the complexity function of an invariant, not necessary closed, subset of a two-sided shift space to compute the polynomial entropy of the induced dynamics on the hyperspace of continua for certain one-dimensional dynamical systems.…

In this paper we study the polynomial entropy of homeomorphism on compact metric space. We construct a homeomorphism on a compact metric space with vanishing polynomial entropy that it is not equicontinuous. Also we give examples with…

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…

We will consider various definitions of topological entropy for multivalued nonautonomous dynamical systems in compact Hausdorff spaces. Some of them can deal with arbitrary multivalued maps, i.e. when no restrictions are imposed on them.…

We prove that the polynomial entropy of the induced map $F_n(f)$ on the $n$-fold symmetric product of a compact space $X$ and its suspension are both equal to $nh_{pol}(f)$, when $f:X\to X$ is a homeomorphism with a finite chain recurrent…

We introduce the notion of a one-way horseshoe and show that the polynomial entropy of an interval map is given by one-way horseshoes of iterates of the map, obtaining in such a way an analogue of Misiurewicz's theorem on topological…

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…

We show that the polynomial entropy of homeomorphisms on regular curves is bounded above by one. Moreover, the polynomial entropy equals one under the fairly mild condition that the homeomorphism possesses a wandering point. We obtain a…

We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.

We consider a class $\mathcal{F}$ of Markov multi-maps on the unit interval. Any multi-map gives rise to a space of trajectories, which is a closed, shift-invariant subset of $[0,1]^{\mathbb{Z}_+}$. For a multi-map in $\mathcal{F}$, we show…

In this paper we discuss two different existing algorithms for computing topological entropy and we perform one of them in order to compute the isentropes for cubic polynomials.

We illustrate the use of the notion of derived recurrences introduced earlier to evaluate the algebraic entropy of self-maps of projective spaces. We in particular give an example, where a complete proof is still awaited, but where…

We give an upper bound for the topological entropy of maps on inverse limit spaces in terms of their set-valued components. In a special case of a diagonal map on the inverse limit space $\underleftarrow{\lim}(I,f)$, where every diagonal…

The structure of isentropes (i.e. level sets of constant topological entropy) including the monotonicity of entropy, has been studied for polynomial interval maps since the 1980s. We show that isentropes of multimodal polynomial families…

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 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…

In this paper we study interval maps $f$ with zero topological entropy that are crooked; i.e. whose inverse limit with $f$ as the single bonding map is the pseudo-arc. We show that there are uncountably many pairwise non-conjugate zero…

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…

We describe a maximum entropy approach for computing volumes and counting integer points in polyhedra. To estimate the number of points from a particular set X in R^n in a polyhedron P in R^n, by solving a certain entropy maximization…