7 research outputs found
Critical connectedness of thin arithmetical discrete planes
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
-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 smallest entry to the other
ones. We provide a characterization of the discrete planes with critical
thickness that have zero intercept and that are -connected. Our tools rely
on the notion of dual substitution which is a geometric version of the usual
notion of substitution acting on words. We associate with the fully subtractive
algorithm a set of substitutions whose incidence matrix is provided by the
matrices of the algorithm, and prove that their geometric counterparts generate
arithmetic discrete planes.Comment: 18 pages, v2 includes several corrections and is a long version of
the DGCI extended abstrac
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.Comment: 15 pages, v2 includes minor corrections to match the published
versio
Conjugacy of unimodular Pisot substitutions subshifts to domain exchanges
We prove that any unimodular Pisot substitution subshift is measurably
conjugate to a domain exchange in Euclidean spaces which factorizes onto a
minimal rotation on a torus. This generalizes the pioneer works of Rauzy and
Arnoux-Ito providing geometric realizations to any unimodular Pisot
substitution without any additional combinatorial condition.Comment: 29 p. In this new version, a gap in the proof of the main theorem has
been fixe