Displaying 601 – 620 of 668

Showing per page

The recurrence dimension for piecewise monotonic maps of the interval

Franz Hofbauer (2005)

Annali della Scuola Normale Superiore di Pisa - Classe di Scienze

We investigate a weighted version of Hausdorff dimension introduced by V. Afraimovich, where the weights are determined by recurrence times. We do this for an ergodic invariant measure with positive entropy of a piecewise monotonic transformation on the interval [ 0 , 1 ] , giving first a local result and proving then a formula for the dimension of the measure in terms of entropy and characteristic exponent. This is later used to give a relation between the dimension of a closed invariant subset and a pressure...

The set of recurrent points of a continuous self-map on compact metric spaces and strong chaos

Lidong Wang, Gongfu Liao, Zhizhi Chen, Xiaodong Duan (2003)

Annales Polonici Mathematici

We discuss the existence of an uncountable strongly chaotic set of a continuous self-map on a compact metric space. It is proved that if a continuous self-map on a compact metric space has a regular shift invariant set then it has an uncountable strongly chaotic set in which each point is recurrent, but is not almost periodic.

The size of the chain recurrent set for generic maps on an n-dimensional locally (n-1)-connected compact space

Katsuya Yokoi (2010)

Colloquium Mathematicae

For n ≥ 1, given an n-dimensional locally (n-1)-connected compact space X and a finite Borel measure μ without atoms at isolated points, we prove that for a generic (in the uniform metric) continuous map f:X → X, the set of points which are chain recurrent under f has μ-measure zero. The same is true for n = 0 (skipping the local connectedness assumption).

The structure of disjoint iteration groups on the circle

Krzysztof Ciepliński (2004)

Czechoslovak Mathematical Journal

The aim of the paper is to investigate the structure of disjoint iteration groups on the unit circle 𝕊 1 , that is, families = { F v 𝕊 1 𝕊 1 v V } of homeomorphisms such that F v 1 F v 2 = F v 1 + v 2 , v 1 , v 2 V , and each F v either is the identity mapping or has no fixed point ( ( V , + ) is an arbitrary 2 -divisible nontrivial (i.e., c a r d V > 1 ) abelian group).

The topological entropy versus level sets for interval maps

Jozef Bobok (2002)

Studia Mathematica

We answer affirmatively Coven's question [PC]: Suppose f: I → I is a continuous function of the interval such that every point has at least two preimages. Is it true that the topological entropy of f is greater than or equal to log 2?

The topological entropy versus level sets for interval maps (part II)

Jozef Bobok (2005)

Studia Mathematica

Let f: [a,b] → [a,b] be a continuous function of the compact real interval such that (i) c a r d f - 1 ( y ) 2 for every y ∈ [a,b]; (ii) for some m ∈ ∞,2,3,... there is a countable set L ⊂ [a,b] such that c a r d f - 1 ( y ) m for every y ∈ [a,b]∖L. We show that the topological entropy of f is greater than or equal to log m. This generalizes our previous result for m = 2.

The universal minimal system for the group of homeomorphisms of the Cantor set

E. Glasner, B. Weiss (2003)

Fundamenta Mathematicae

Each topological group G admits a unique universal minimal dynamical system (M(G),G). For a locally compact noncompact group this is a nonmetrizable system with a rich structure, on which G acts effectively. However there are topological groups for which M(G) is the trivial one-point system (extremely amenable groups), as well as topological groups G for which M(G) is a metrizable space and for which one has an explicit description. We show that for the topological group G = Homeo(E) of self-homeomorphisms...

Three complexity functions

Sébastien Ferenczi, Pascal Hubert (2012)

RAIRO - Theoretical Informatics and Applications

For an extensive range of infinite words, and the associated symbolic dynamical systems, we compute, together with the usual language complexity function counting the finite words, the minimal and maximal complexity functions we get by replacing finite words by finite patterns, or words with holes.

Three complexity functions

Sébastien Ferenczi, Pascal Hubert (2012)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

For an extensive range of infinite words, and the associated symbolic dynamical systems, we compute, together with the usual language complexity function counting the finite words, the minimal and maximal complexity functions we get by replacing finite words by finite patterns, or words with holes.

Three complexity functions

Sébastien Ferenczi, Pascal Hubert (2012)

RAIRO - Theoretical Informatics and Applications

For an extensive range of infinite words, and the associated symbolic dynamical systems, we compute, together with the usual language complexity function counting the finite words, the minimal and maximal complexity functions we get by replacing finite words by finite patterns, or words with holes.

Tilings associated with non-Pisot matrices

Maki Furukado, Shunji Ito, E. Arthur Robinson (2006)

Annales de l’institut Fourier

Suppose A G l d ( ) has a 2-dimensional expanding subspace E u , satisfies a regularity condition, called “good star”, and has A * 0 , where A * is an oriented compound of A . A morphism θ of the free group on { 1 , 2 , , d } is called a non-abelianization of A if it has structure matrix A . We show that there is a tiling substitution Θ whose “boundary substitution” θ = Θ is a non-abelianization of A . Such a tiling substitution Θ leads to a self-affine tiling of E u 2 with A u : = A | E u G L 2 ( ) as its expansion. In the last section we find conditions on A so...

Currently displaying 601 – 620 of 668