Integer semigroups associated with Dumont-Thomas numeration systems
Summary: Given a primitive substitution, we define different binary operations on infinite subsets of the nonnegative integers. These binary operations are defined with the help of the Dumont-Thomas numeration system; that is, a numeration system associated with the substitution. We give conditions for these semigroups to have an identity element. We show that they are not finitely generated. These semigroups define actions on the set of positive integers. We describe the orbits of these actions. We also estimate the density of these sets as subsets of the positive integers.
- Algèbre commutative
- Automatic Sequences
- Digital sum moments and substitutions
- Fibonacci multiplication
- Généralisation de la multiplication de Fibonacci. (Generalization of the Fibonacci multiplication)
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 4202380 (Why is no real title available?)
- scientific article; zbMATH DE number 15266 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 1175385 (Why is no real title available?)
- Mathematical Foundations of Computer Science 2005
- Matrix Analysis
- Nombres algébriques et substitutions
- Odometers and systems of numeration
- Representations of numbers and finite automata
- Semigroups and the self-similar structure of the flipped Tribonacci substitution
- Some remarks about Fibonacci multiplication
- Substitutions in dynamics, arithmetics and combinatorics
- Systèmes de numération et fonctions fractales relatifs aux substitutions. (Numeration systems and fractal functions related to substitutions)
- Tribonacci multiplication
This page was built for publication: Integer semigroups associated with Dumont-Thomas numeration systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2449271)
