Displaying 81 – 100 of 668

Showing per page

Billiard complexity in the hypercube

Nicolas Bedaride, Pascal Hubert (2007)

Annales de l’institut Fourier

We consider the billiard map in the hypercube of d . We obtain a language by coding the billiard map by the faces of the hypercube. We investigate the complexity function of this language. We prove that n 3 d - 3 is the order of magnitude of the complexity.

Borel isomorphism of SPR Markov shifts

Mike Boyle, Jérôme Buzzi, Ricardo Gómez (2014)

Colloquium Mathematicae

We show that strongly positively recurrent Markov shifts (including shifts of finite type) are classified up to Borel conjugacy by their entropy, period and their numbers of periodic points.

Bounce trajectories in plane tubular domains

Roberto Peirone (1989)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

We state that in opportune tubular domains any two points are connected by a bounce trajectory and that there exist non-trivial periodic bounce trajectories.

Bouquets of circles for lamination languages and complexities

Philippe Narbel (2014)

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

Laminations are classic sets of disjoint and non-self-crossing curves on surfaces. Lamination languages are languages of two-way infinite words which code laminations by using associated labeled embedded graphs, and which are subshifts. Here, we characterize the possible exact affine factor complexities of these languages through bouquets of circles, i.e. graphs made of one vertex, as representative coding graphs. We also show how to build families of laminations together with corresponding lamination...

Cardinality of Rauzy classes

Vincent Delecroix (2013)

Annales de l’institut Fourier

Rauzy classes form a partition of the set of irreducible permutations. They were introduced as part of a renormalization algorithm for interval exchange transformations. We prove an explicit formula for the cardinality of each Rauzy class. Our proof uses a geometric interpretation of permutations and Rauzy classes in terms of translation surfaces and moduli spaces.

Chaos made visual.

M. de Guzmán (1996)

Revista Matemática de la Universidad Complutense de Madrid

In this paper we show how the main properties of chaos can be fully visualized at the light of a very easy to handle object, the tent function. Although very concrete, this case is representative of a very large number of examples, with more or less the same properties.

Chaotic behaviour of the map x ↦ ω(x, f)

Emma D’Aniello, Timothy Steele (2014)

Open Mathematics

Let K(2ℕ) be the class of compact subsets of the Cantor space 2ℕ, furnished with the Hausdorff metric. Let f ∈ C(2ℕ). We study the map ω f: 2ℕ → K(2ℕ) defined as ω f (x) = ω(x, f), the ω-limit set of x under f. Unlike the case of n-dimensional manifolds, n ≥ 1, we show that ω f is continuous for the generic self-map f of the Cantor space, even though the set of functions for which ω f is everywhere discontinuous on a subsystem is dense in C(2ℕ). The relationships between the continuity of ω f and...

Characterization of ω -limit sets of continuous maps of the circle

David Pokluda (2002)

Commentationes Mathematicae Universitatis Carolinae

In this paper we extend results of Blokh, Bruckner, Humke and Sm’ıtal [Trans. Amer. Math. Soc. 348 (1996), 1357–1372] about characterization of ω -limit sets from the class 𝒞 ( I , I ) of continuous maps of the interval to the class 𝒞 ( 𝕊 , 𝕊 ) of continuous maps of the circle. Among others we give geometric characterization of ω -limit sets and then we prove that the family of ω -limit sets is closed with respect to the Hausdorff metric.

Currently displaying 81 – 100 of 668