Timo Jolivet

Learn More
We prove that the symbolic dynamical system generated by a purely substitu-tive Arnoux-Rauzy sequence is measurably conjugate to a toral translation. The proof is based on an explicit construction of a fundamental domain with a fractal boundary (a Rauzy fractal) for this toral translation. Such a fractal is obtained as the Hausdorff limit of a sequence of(More)
An arithmetical discrete plane is said to have critical connecting thickness if its thickness is equal to the infimum of the set of values that preserve its 2-connectedness. This infimum thickness can be computed thanks to the fully subtractive algorithm. This multidimensional continued fraction algorithm consists, in its linear form, in subtracting the(More)
Given a finite set S of unimodular Pisot substitutions, we provide a method for characterizing the infinite sequences over S that allow to generate a full discrete plane when, starting from a finite seed, we iterate the multidimensional dual substitutions associated with S. We apply our results to study the substitutions associated with the Brun(More)
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 planar sets, where each set is the projection of a finite union of faces of unit cubes. We exploit this combinatorial definition to prove the(More)
In brief, this license authorizes each and everybody to share (to copy, distribute and transmit) the work under the following conditions, without impairing or restricting the authors' moral rights: Attribution: The work must be attributed to its authors. LIPIcs is a series of high-quality conference proceedings across all fields in informatics. LIPIcs(More)
We define a generic algorithmic framework to prove pure discrete spectrum for the substitutive symbolic dynamical systems associated with some infinite families of Pisot substitutions. We focus on the families obtained as finite products of the three-letter substitutions associated with the multidimensional continued fraction algorithms of Brun and(More)
Multidimensional combinatorial substitutions are rules that replace symbols by finite patterns of symbols in Z d. We focus on the case where the patterns are not necessarily rectangular, which requires a specific description of the way they are glued together in the image by a substitution. Two problems can arise when defining a substitution in such a way:(More)
  • 1