Fully Subtractive Algorithm, Tribonacci numeration and connectedness of discrete planes - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue RIMS Kôkyûroku Bessatsu Année : 2014

Fully Subtractive Algorithm, Tribonacci numeration and connectedness of discrete planes

Résumé

We investigate connections between a well known multidimensional continued fraction algorithm, the so-called fully subtractive algorithm, the finiteness property for beta-numeration, and the connectedness of arithmetic discrete hyperplanes. A discrete hyperplane is said to be critical if its thickness is equal to the infimum of the set of thicknesses for which discrete hyperplanes with same normal vector are connected. We focus on particular planes the parameters of which belong to the cubic extension generated by the Tribonacci number, we prove connectedness in the critical case, and we exhibit an intriguing tree structure rooted at the origin.
Fichier non déposé

Dates et versions

hal-01262173 , version 1 (26-01-2016)

Identifiants

  • HAL Id : hal-01262173 , version 1

Citer

Valérie Berthé, Eric Domenjoud, Damien Jamet, Xavier Provençal. Fully Subtractive Algorithm, Tribonacci numeration and connectedness of discrete planes. RIMS Kôkyûroku Bessatsu, 2014, Numeration and Substitution 2012, B46, pp.159-174. ⟨hal-01262173⟩
139 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More