SearcharxivSearch

arXiv subjects

Ana Anusic

Publications and source records attributed to Ana Anusic.

6 recordsLinked to original sources

Graph and backward asymptotics of the tent map

The tent map family is arguably the simplest 1-parametric family of maps with non-trivial dynamics and it is still an active subject of research. In recent works the second author, jointly with J. Yorke, studied the graph and backward limits of S-unimodal maps. In this article we generalize those results to tent-like unimodal maps. By tent-like here we mean maps that share fundamental properties that characterize tent maps, namely unimodal maps without wandering intervals nor attracting cycles and whose graph has a finite number of nodes.

math.DS

Strongly commuting interval maps

Maps $f,g\colon I\to I$ are called strongly commuting if $f\circ g^{-1}=g^{-1}\circ f$. We show that strongly commuting, piecewise monotone maps $f,g$ can be decomposed into a finite number of invariant intervals (or period 2 intervals) on which $f,g$ are either both open maps, or at least one of them is monotone. As a consequence, we show that strongly commuting piecewise monotone interval maps have a common fixed point. Results of the paper also have implications in understanding dynamical properties of certain maps on inverse limit spaces.

math.DS

Topological entropy of diagonal maps on inverse limit spaces

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 component is the same map $g\colon I\to I$ which strongly commutes with $f$ (i.e. $f^{-1}\circ g=g\circ f^{-1}$), we show that the entropy equals $\max\{\textrm{Ent}(f),\textrm{Ent}(g)\}$. As a side product, we develop some techniques for computing topological entropy of set-valued maps.

math.DS

Accessible points of planar embeddings of tent inverse limit spaces

In this paper we study a class of embeddings of tent inverse limit spaces. We introduce techniques relying on the Milnor-Thurston kneading theory and use them to study sets of accessible points and prime ends of given embeddings. We completely characterize accessible points and prime ends of standard embeddings arising from the Barge-Martin construction of global attractors. In other (non-extendable) embeddings we find phenomena which do not occur in the standard embeddings.

math.DS

The Core Ingram Conjecture for non-recurrent critical points

We study inverse limit spaces of tent maps, and the Ingram Conjecture, which states that the inverse limit spaces of tent maps with different slopes are non-homeomorphic. When the tent map is restricted to its core, so there is no ray compactifying on the inverse limit space, this result is referred to as the Core Ingram Conjecture. We prove the Core Ingram Conjecture when the critical point is non-recurrent and not preperiodic.

math.DS