Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Computation of L_⊕ f ...
Article

Computation of L_⊕ for several cubic Pisot numbers

Julien Bernat (1)
(1) Institut de mathématiques de Luminy
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 2007
Last modified on
March 31, 2025
Volume 9
vol. 9:2
DOI
10.46298/dmtcs.405
License
https://about.hal.science/hal-authorisation-v1
Indicators
574
Views
565
Downloads

Computation of L_⊕ for several cubic Pisot numbers

Julien Bernat (1)
(1) Institut de mathématiques de Luminy
Abstract
In this article, we are dealing with β-numeration, which is a generalization of numeration in a non-integer base. We consider the class of simple Parry numbers such that dβ(1) = 0.k1d-1 kd with d ∈ ℕ, d ≥ 2 and k1 ≥ kd ≥ 1. We prove that these elements define Rauzy fractals that are stable under a central symmetry. We use this result to compute, for several cases of cubic Pisot units, the maximal length among the lengths of the finite β-fractional parts of sums of two β-integers, denoted by L_⊕. In particular, we prove that L_⊕ = 5 in the Tribonacci case.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Cited by

Source: OpenCitations

  • Arithmetics of β-expansions in Fq ((x-1))

    Filomat

    Authors : S. Zouari

    Journal reference : Volume 38, 2024, pp. 8961-8970

    DOI : 10.2298/fil2425961z
  • Arithmetics in number systems with a negative base

    Theoretical Computer Science

    Authors : Z. Masáková ORCID, E. Pelantová ORCID, T. Vávra ORCID

    Journal reference : Volume 412, 2010, pp. 835-845

    DOI : 10.1016/j.tcs.2010.11.033
  • Factor versus palindromic complexity of uniformly recurrent infinite words

    Theoretical Computer Science

    Authors : Peter Baláži, Zuzana Masáková ORCID, Edita Pelantová ORCID

    Journal reference : Volume 380, 2007, pp. 266-275

    DOI : 10.1016/j.tcs.2007.03.019
  • Confluent Parry numbers, their spectra, and integers in positive- and negative-base number systems

    Journal de Théorie des Nombres de Bordeaux

    Authors : Daniel Dombek, Zuzana Masáková ORCID, Tomáš Vávra ORCID

    Journal reference : Volume 27, 2015, pp. 745-768

    DOI : 10.5802/jtnb.922
Preview
Loading PDF preview...