Displaying 21 – 40 of 668

Showing per page

A generalization of the self-dual induction to every interval exchange transformation

Sébastien Ferenczi (2014)

Annales de l’institut Fourier

We generalize to all interval exchanges the induction algorithm defined by Ferenczi and Zamboni for a particular class. Each interval exchange corresponds to an infinite path in a graph whose vertices are certain unions of trees we call castle forests. We use it to describe those words obtained by coding trajectories and give an explicit representation of the system by Rokhlin towers. As an application, we build the first known example of a weakly mixing interval exchange outside the hyperelliptic...

A gradient inequality at infinity for tame functions.

Didier D'Acunto, Vincent Grandjean (2005)

Revista Matemática Complutense

Let f be a C1 function defined over Rn and definable in a given o-minimal structure M expanding the real field. We prove here a gradient-like inequality at infinity in a neighborhood of an asymptotic critical value c. When f is C2 we use this inequality to discuss the trivialization by the gradient flow of f in a neighborhood of a regular asymptotic critical level.

A graph approach to computing nondeterminacy in substitutional dynamical systems

Toke M. Carlsen, Søren Eilers (2007)

RAIRO - Theoretical Informatics and Applications

We present an algorithm which for any aperiodic and primitive substitution outputs a finite representation of each special word in the shift space associated to that substitution, and determines when such representations are equivalent under orbit and shift tail equivalence. The algorithm has been implemented and applied in the study of certain new invariants for flow equivalence of substitutional dynamical systems.

A linear condition determining local or global existence for nonlinear problems

John Neuberger, John Neuberger, James Swift (2013)

Open Mathematics

Given a nonlinear autonomous system of ordinary or partial differential equations that has at least local existence and uniqueness, we offer a linear condition which is necessary and sufficient for existence to be global. This paper is largely concerned with numerically testing this condition. For larger systems, principals of computations are clear but actual implementation poses considerable challenges. We give examples for smaller systems and discuss challenges related to larger systems. This...

A map maintaining the orbits of a given d -action

Bartosz Frej, Agata Kwaśnicka (2016)

Colloquium Mathematicae

Giordano et al. (2010) showed that every minimal free d -action of a Cantor space X is orbit equivalent to some ℤ-action. Trying to avoid the K-theory used there and modifying Forrest’s (2000) construction of a Bratteli diagram, we show how to define a (one-dimensional) continuous and injective map F on X∖one point such that for a residual subset of X the orbits of F are the same as the orbits of a given minimal free d -action.

A matrix formalism for conjugacies of higher-dimensional shifts of finite type

Michael Schraudner (2008)

Colloquium Mathematicae

We develop a natural matrix formalism for state splittings and amalgamations of higher-dimensional subshifts of finite type which extends the common notion of strong shift equivalence of ℤ⁺-matrices. Using the decomposition theorem every topological conjugacy between two d -shifts of finite type can thus be factorized into a finite chain of matrix transformations acting on the transition matrices of the two subshifts. Our results may be used algorithmically in computer explorations on topological...

A new algebraic invariant for weak equivalence of sofic subshifts

Laura Chaubard, Alfredo Costa (2008)

RAIRO - Theoretical Informatics and Applications

It is studied how taking the inverse image by a sliding block code affects the syntactic semigroup of a sofic subshift. The main tool are ζ-semigroups, considered as recognition structures for sofic subshifts. A new algebraic invariant is obtained for weak equivalence of sofic subshifts, by determining which classes of sofic subshifts naturally defined by pseudovarieties of finite semigroups are closed under weak equivalence. Among such classes are the classes of almost finite type subshifts...

A note on a conjecture of Duval and sturmian words

Filippo Mignosi, Luca Q. Zamboni (2002)

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

We prove a long standing conjecture of Duval in the special case of sturmian words.

A note on the structure of quadratic Julia sets

Karsten Keller (1997)

Commentationes Mathematicae Universitatis Carolinae

In a series of papers, Bandt and the author have given a symbolic and topological description of locally connected quadratic Julia sets by use of special closed equivalence relations on the circle called Julia equivalences. These equivalence relations reflect the landing behaviour of external rays in the case of local connectivity, and do not apply completely if a Julia set is connected but fails to be locally connected. However, rational external rays land also in the general case. The present...

Currently displaying 21 – 40 of 668