An infinite permutation is a linear ordering of N. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this paper, we try to extend to permutations the notion of automaticity. As we shall show, the standard definitions which are equivalent in the case of words are not equivalent in the context of permutations. We investigate the relationships between these definitions and prove that...

An infinite permutation is a linear ordering of N. We study properties
of infinite permutations analogous to those of infinite words, and show some resemblances
and some differences between permutations and words. In this paper, we try to extend to
permutations the notion of automaticity. As we shall show, the standard definitions which
are equivalent in the case of words are not equivalent in the context of permutations. We
investigate the relationships...

An infinite permutation is a linear ordering of N. We study properties
of infinite permutations analogous to those of infinite words, and show some resemblances
and some differences between permutations and words. In this paper, we try to extend to
permutations the notion of automaticity. As we shall show, the standard definitions which
are equivalent in the case of words are not equivalent in the context of permutations. We
investigate the relationships...

Let $M\left(r\right)$ denote the set of real numbers $\alpha $ whose base-$r$ digit expansion is ultimately primitive substitutive, i.e., contains a tail which is the image (under a letter to letter morphism) of a fixed point of a primitive substitution. We show that the set $M\left(r\right)$ is closed under multiplication by rational numbers, but not closed under addition.

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

For each $m\ge 2,$ we consider the $m$-bonacci numbers defined by ${F}_{k}={2}^{k}$ for $0\le k\le m-1$ and ${F}_{k}={F}_{k-1}+{F}_{k-2}+\cdots +{F}_{k-m}$ for $k\ge m.$ When $m=2,$ these are the usual Fibonacci numbers. Every positive integer $n$ may be expressed as a sum of distinct $m$-bonacci numbers in one or more different ways. Let ${R}_{m}\left(n\right)$ be the number of partitions of $n$ as a sum of distinct $m$-bonacci numbers. Using a theorem of Fine and Wilf, we obtain a formula for ${R}_{m}\left(n\right)$ involving sums of binomial coefficients modulo $2.$ In addition we show that this formula may be used to determine the number of partitions...

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

For a class of $d$-interval exchange transformations, which we call the symmetric class, we define a new self-dual induction process in which the system is successively induced on a union of sub-intervals. This algorithm gives rise to an underlying graph structure which reflects the dynamical behavior of the system, through the Rokhlin towers of the induced maps. We apply it to build a wide assortment of explicit examples on four intervals having different dynamical properties: these include the first...

Among the various ways to construct a characteristic Sturmian word, one of the most used consists in defining an infinite sequence of prefixes that are standard. Nevertheless in any characteristic word , some standard words occur that are not prefixes of . We characterize all standard words occurring in any characteristic word (and so in any Sturmian word) using firstly morphisms, then standard prefixes and finally palindromes.

In this paper we describe a $2$-dimensional generalization of the Euclidean algorithm
which stems from the dynamics of $3$-interval exchange transformations. We investigate
various diophantine properties of the algorithm including the quality of simultaneous
approximations. We show it verifies the following Lagrange type theorem: the algorithm is
eventually periodic if and only if the parameters lie in the same quadratic extension of
$\mathbb{Q}.$

In a 1982 paper Rauzy showed that the subshift $(X,T)$ generated by the morphism $1\mapsto 12$, $2\mapsto 13$ and $3\mapsto 1$ is a natural coding of a rotation on the two-dimensional torus ${\mathbb{T}}^{2}$, i.e., is measure-theoretically conjugate to an exchange of three fractal domains on a compact set in ${\mathbb{R}}^{2},$ each domain being translated by the same vector modulo a lattice. It was believed more generally that each sequence of block complexity $2n+1$ satisfying a combinatorial criterion known as the $\u2606$ condition of Arnoux and Rauzy codes the orbit of a point...

In this paper, we solve some open problems related to (pseudo)palindrome closure operators and to the infinite words generated by their iteration, that is, standard episturmian and pseudostandard words. We show that if is an involutory antimorphism of , then the right and left -palindromic closures of any factor of a -standard word are also factors of some -standard word. We also introduce the class of pseudostandard words with “seed”, obtained by iterated pseudopalindrome closure starting from...

Download Results (CSV)