Related papers: Computing the topological entropy of unimodal maps

We introduce and study the notion of a directional complexity and entropy for maps of degree 1 on the circle. For piecewise affine Markov maps we use symbolic dynamics to relate this complexity to the symbolic complexity. We apply a…

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 consider Milnor's "tower algorithm" in the space of piecewise monotone maps, an iterative algorithm on the space of metrics which unifies, on the one hand, Thurston's iterative scheme which converges to holomorphic models, and, on the…

We propose an algorithm to estimate the topology of an embedded metric graph from a well-sampled finite subset of the underlying graph.

We generalize the definition of topological entropy given by Adler, Konheim, and McAndrew (AKM) for piecewise continuous self-maps defined on a compact interval (pc-maps). For this notion of entropy, we prove that the properties of the…

The topological entropy of piecewise affine maps is studied. It is shown that singularities may contribute to the entropy only if there is angular expansion and we bound the entropy via the expansion rates of the map. As a corollary we…

We establish the analogue for maps on trees of the result established in two papers by the first author for interval maps, that a continuous self- map for which all but countably many points have at least m preimages (and none have less…

Topological conjugateness of one dimensional unimodal dynamical systems, which are generated by interval [0, 1] into itself maps are studied. We study the smoothness and differentiability of the conjugacy of symmetrical and non-symmetrical…

Any continuous, transitive, piecewise monotonic map is determined up to a binary choice by its dimension module with the associated finite sequence of generators. The dimension module by itself determines the topological entropy of any…

We compute the polynomial entropy of the induced maps on hyperspace for a homeomorphism $f$ of an interval or a circle with finitely many non-wandering points.

We study the jump of topological entropy for $C^r$ interval or circle maps. We prove in particular that the topological entropy is continuous at any $f \in C^r([0; 1])$ with $h_{top}(f) > \frac{\log^+ \|f'\|_\infty}{r}$. To this end we…

We apply renormalized entropy as a complexity measure to the logistic and sine-circle maps. In the case of logistic map, renormalized entropy decreases (increases) until the accumulation point (after the accumulation point up to the most…

The dynamics of one dimensional iterative maps in the regime of fully developed chaos is studied in detail. Motivated by the observation of dynamical structures around the unstable fixed point we introduce the geometrical concept of a…

In this note we construct measures of maximal entropy for a certain class of maps with critical points called Viana maps. The main ingredients of the proof are the non-uniform expansion features and the slow recurrence (to the critical set)…

For a continuous map on a topological graph containing a loop $S$ it is possible to define the degree (with respect to the loop $S$) and, for a map of degree $1$, rotation numbers. We study the rotation set of these maps and the periods 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 a "limit-free formula" simplifying the computation of the topological entropy for topological automorphisms of totally disconnected locally compact groups. This result allows us to extend several basic properties of the topological…

We introduce an effective algorithmic method for the computation of a lower bound for uniform expansion in one-dimensional dynamics. The approach employs interval arithmetic and thus provides a rigorous numerical result (computer-assisted…

This note presents an approach to studying the iterates of a mapping whose restriction to the complement of a finite set is continuous and open. The main examples to which the approach can be applied are piecewise monotone mappings defined…

A reparametrization (of a continuous path) is given by a surjective weakly increasing self-map of the unit interval. We show that the monoid of reparametrizations (with respect to compositions) can be understood via ``stop-maps'' that allow…