Page 1 Next

Displaying 1 – 20 of 79

Showing per page

Census algorithms for chinese remainder pseudorank

David Laing, Bruce Litow (2008)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We investigate the density and distribution behaviors of the chinese remainder representation pseudorank. We give a very strong approximation to density, and derive two efficient algorithms to carry out an exact count (census) of the bad pseudorank integers. One of these algorithms has been implemented, giving results in excellent agreement with our density analysis out to 5189 -bit integers.

Census algorithms for chinese remainder pseudorank

David Laing, Bruce Litow (2007)

RAIRO - Theoretical Informatics and Applications

We investigate the density and distribution behaviors of the chinese remainder representation pseudorank. We give a very strong approximation to density, and derive two efficient algorithms to carry out an exact count (census) of the bad pseudorank integers. One of these algorithms has been implemented, giving results in excellent agreement with our density analysis out to 5189-bit integers.

Cobham's theorem for substitutions

Fabien Durand (2011)

Journal of the European Mathematical Society

The seminal theorem of Cobham has given rise during the last 40 years to a lot of work about non-standard numeration systems and has been extended to many contexts. In this paper, as a result of fifteen years of improvements, we obtain a complete and general version for the so-called substitutive sequences. Let α and β be two multiplicatively independent Perron numbers. Then a sequence x A , where A is a finite alphabet, is both α -substitutive and β -substitutive if and only if x is ultimately periodic....

Combinatoire de mots récurrents de complexité n+2

Idrissa Kaboré, Théodore Tapsoba (2007)

RAIRO - Theoretical Informatics and Applications

Nous établissons quelques propriétés des mots sturmiens et classifions, ensuite, les mots infinis qui possèdent, pour tout entier naturel non nul n, exactement n+2 facteurs de longueur n. Nous définissons également la notion d'insertion k à k sur les mots infinis puis nous calculons la complexité des mots obtenus en appliquant cette notion aux mots sturmiens. Enfin nous étudions l'équilibre et la palindromie d'une classe particulière de mots de complexité n+2 que nous appelons mots quasi-sturmiens...

Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers

Lubomíra Balková, Edita Pelantová, Ondřej Turek (2007)

RAIRO - Theoretical Informatics and Applications

We study some arithmetical and combinatorial properties of β-integers for β being the larger root of the equation x2 = mx - n,m,n ∈ ℵ, m ≥ n +2 ≥ 3. We determine with the accuracy of ± 1 the maximal number of β-fractional positions, which may arise as a result of addition of two β-integers. For the infinite word uβ> coding distances between the consecutive β-integers, we determine precisely also the balance. The word uβ> is the only fixed point of the morphism A → Am-1B and B → Am-n-1B. In...

Currently displaying 1 – 20 of 79

Page 1 Next