Computation of L ⊕ for several cubic Pisot numbers

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.k 1 d-1  k d with d ∈ ℕ, d ≥ 2 and k 1 &...

Full description

Bibliographic Details
Main Author: Julien Bernat
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2007-05-01
Series:Discrete Mathematics & Theoretical Computer Science
Online Access:http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/665
id doaj-933912baf1a54dee91a73e990c208519
record_format Article
spelling doaj-933912baf1a54dee91a73e990c2085192020-11-24T23:38:44ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1462-72641365-80502007-05-0192Computation of L ⊕ for several cubic Pisot numbersJulien BernatIn 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.k 1 d-1  k d with d ∈ ℕ, d ≥ 2 and k 1  ≥ k d  ≥ 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. http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/665
collection DOAJ
language English
format Article
sources DOAJ
author Julien Bernat
spellingShingle Julien Bernat
Computation of L ⊕ for several cubic Pisot numbers
Discrete Mathematics & Theoretical Computer Science
author_facet Julien Bernat
author_sort Julien Bernat
title Computation of L ⊕ for several cubic Pisot numbers
title_short Computation of L ⊕ for several cubic Pisot numbers
title_full Computation of L ⊕ for several cubic Pisot numbers
title_fullStr Computation of L ⊕ for several cubic Pisot numbers
title_full_unstemmed Computation of L ⊕ for several cubic Pisot numbers
title_sort computation of l ⊕ for several cubic pisot numbers
publisher Discrete Mathematics & Theoretical Computer Science
series Discrete Mathematics & Theoretical Computer Science
issn 1462-7264
1365-8050
publishDate 2007-05-01
description 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.k 1 d-1  k d with d ∈ ℕ, d ≥ 2 and k 1  ≥ k d  ≥ 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.
url http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/665
work_keys_str_mv AT julienbernat computationoflforseveralcubicpisotnumbers
_version_ 1725516021529313280