Searcharxiv⌕ Search

arXiv subjects

Valérie Berthé

Publications and source records attributed to Valérie Berthé.

44 records · Page 3Linked to original sources

Connectedness of fractals associated with Arnoux-Rauzy substitutions

Rauzy fractals are compact sets with fractal boundary that can be associated with any unimodular Pisot irreducible substitution. These fractals can be defined as the Hausdorff limit of a sequence of compact sets, where each set is a renormalized projection of a finite union of faces of unit cubes. We exploit this combinatorial definition to prove the connectedness of the Rauzy fractal associated with any finite product of three-letter Arnoux-Rauzy substitutions.

math.CO↗

Factor Complexity of S-adic sequences generated by the Arnoux-Rauzy-Poincaré Algorithm

The Arnoux-Rauzy-Poincaré multidimensional continued fraction algorithm is obtained by combining the Arnoux-Rauzy and Poincaré algorithms. It is a generalized Euclidean algorithm. Its three-dimensional linear version consists in subtracting the sum of the two smallest entries to the largest if possible (Arnoux-Rauzy step), and otherwise, in subtracting the smallest entry to the median and the median to the largest (the Poincaré step), and by performing when possible Arnoux-Rauzy steps in priority. After renormalization it provides a piecewise fractional map of the standard $2$-simplex. We study here the factor complexity of its associated symbolic dynamical system, defined as an $S$-adic system. It is made of infinite words generated by the composition of sequences of finitely many substitutions, together with some restrictions concerning the allowed sequences of substitutions expressed in terms of a regular language. Here, the substitutions are provided by the matrices of the linear version of the algorithm. We give an upper bound for the linear growth of the factor complexity. We then deduce the convergence of the associated algorithm by unique ergodicity.

cs.DM↗

Notes on sets of first return

We prove in this note that, for an alphabet with three letters, the set of first return to a given word in a set satisfying the tree condition is a basis of the free group.

math.CO↗

Balance properties of Arnoux-Rauzy words

The paper deals with balances and imbalances in Arnoux-Rauzy words. We provide sufficient conditions for $C$-balancedness, but our results indicate that even a characterization of 2-balanced Arnoux-Rauzy words on a 3-letter alphabet is not immediate.

cs.FL↗

Selfdual Substitutions in Dimension One

There are several notions of the 'dual' of a word/tile substitution. We show that the most common ones are equivalent for substitutions in dimension one, where we restrict ourselves to the case of two letters/tiles. Furthermore, we obtain necessary and sufficient arithmetic conditions for substitutions being selfdual in this case. Since many connections between the different notions of word/tile substitution are discussed, this paper may also serve as a survey paper on this topic.

math.CO↗

Uniformly balanced words with linear complexity and prescribed letter frequencies

We consider the following problem. Let us fix a finite alphabet A; for any given d-uple of letter frequencies, how to construct an infinite word u over the alphabet A satisfying the following conditions: u has linear complexity function, u is uniformly balanced, the letter frequencies in u are given by the given d-uple. This paper investigates a construction method for such words based on the use of mixed multidimensional continued fraction algorithms.

cs.FL↗

Fractal tiles associated with shift radix systems

Shift radix systems form a collection of dynamical systems depending on a parameter $\mathbf{r}$ which varies in the $d$-dimensional real vector space. They generalize well-known numeration systems such as beta-expansions, expansions with respect to rational bases, and canonical number systems. Beta-numeration and canonical number systems are known to be intimately related to fractal shapes, such as the classical Rauzy fractal and the twin dragon. These fractals turned out to be important for studying properties of expansions in several settings. In the present paper we associate a collection of fractal tiles with shift radix systems. We show that for certain classes of parameters $\mathbf{r}$ these tiles coincide with affine copies of the well-known tiles associated with beta-expansions and canonical number systems. On the other hand, these tiles provide natural families of tiles for beta-expansions with (non-unit) Pisot numbers as well as canonical number systems with (non-monic) expanding polynomials. We also prove basic properties for tiles associated with shift radix systems. Indeed, we prove that under some algebraic conditions on the parameter $\mathbf{r}$ of the shift radix system, these tiles provide multiple tilings and even tilings of the $d$-dimensional real vector space. These tilings turn out to have a more complicated structure than the tilings arising from the known number systems mentioned above. Such a tiling may consist of tiles having infinitely many different shapes. Moreover, the tiles need not be self-affine (or graph directed self-affine).

math.DS↗

Sturm numbers and substitution invariance of 3iet words

In this paper, we give a necessary condition for an infinite word defined by a non-degenerate interval exchange on three intervals (3iet word) to be invariant by a substitution: a natural parameter associated to this word must be a Sturm number. We deduce some algebraic consequences from this condition concerning the incidence matrix of the associated substitution. As a by-product of our proof, we give a combinatorial characterization of 3iet words.

math.CO↗