Skip to Main content Skip to Navigation

Fully Subtractive Algorithm, Tribonacci numeration and connectedness of discrete planes

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01262173
Contributor : Eric Domenjoud <>
Submitted on : Tuesday, January 26, 2016 - 1:32:16 PM
Last modification on : Friday, March 27, 2020 - 3:36:01 AM

Identifiers

  • HAL Id : hal-01262173, version 1

Citation

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, Research Institute for Mathematical Sciences Kyoto University Kyoto, 606-8502 JAPAN, 2014, Numeration and Substitution 2012, pp.159-174. ⟨hal-01262173⟩

Share

Metrics

Record views

195