Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.

Rauzy fractal

Known as: Tribonacci word 
In mathematics, the Rauzy fractal is a fractal set associated to the Tribonacci substitution It has been studied in 1981 by Gérard Rauzy, with the… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Number the cells of a (possibly infinite) chessboard in some way with the numbers 0, 1, 2, ... Consider the cells in order… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
2015
2015
According to a result of Richomme, Saari and Zamboni, the abelian complexity of the Tribonacci word satisfies $\rho^{\mathrm{ab… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
2014
2014
Abstract In this article we study symmetric subsets of Rauzy fractals of unimodular irreducible Pisot substitutions. The symmetry… Expand
2014
2014
There is a long tradition, going back to Hadamard and Morse, of associating symbolic infinite words with dynamical systems coming… Expand
  • figure 1
  • figure 2
2013
2013
We propose a technique for exploring the abelian complexity of recurrent infinite words, focusing particularly on infinite words… Expand
2013
2013
This paper deals with balances and imbalances in Arnoux–Rauzy words. We provide sufficient conditions for C-balancedness, but our… Expand
2013
2013
We prove that every free group of finite rank can be realized as the fundamental group of a planar Rauzy fractal associated with… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
2008
2008
We propose a variation of Wythoff's game on three piles of tokens, in the sense that the losing positions can be derived from the… Expand
  • table 1
  • table 2
  • table 3
  • table 4
Review
2002
Review
2002
  • J. Berstel
  • Int. J. Algebra Comput.
  • 2002
  • Corpus ID: 1656191
Sturmian words are infinite words over a two-letter alphabet that admit a great number of equivalent definitions. Most of them… Expand
  • figure 1
1997
1997
  • V. Sirvent
  • Theor. Comput. Sci.
  • 1997
  • Corpus ID: 5095936
Let (Nn,(+1)n) be the adic system associated to the substitution: 1 → 12,…,(n − 1) → 1n, n → 1. In Sirvent (1996) it was shown… Expand
  • figure 1
  • figure 2