How to write integers in a non-integral basis
From MaRDI portal
Recommendations
Cites work
Cited in
(36)- TWO GROUPS ASSOCIATED WITH QUADRATIC PISOT UNITS
- Cubic pisot unit combinatorial games
- String Attractors of Fixed Points of k-Bonacci-Like Morphisms
- Linear numeration systems, \(\theta\)-developments and finite automata
- Bertrand numeration systems and recognizability
- Automatic sequences based on Parry or Bertrand numeration systems
- Recognizable sets of numbers in nonstandard bases
- AUTOMATIC CONVERSION FROM FIBONACCI REPRESENTATION TO REPRESENTATION IN BASE φ, AND A GENERALIZATION
- Complexity of infinite words associated with beta-expansions
- Convergence of Pascal-like triangles in Parry-Bertrand numeration systems
- On the sequentiality of the successor function
- Robustness of Pisot-regular sequences
- On recognizable sets of integers
- Real numbers having ultimately periodic representations in abstract numeration systems
- Geometric study of the beta-integers for a Perron number and mathematical quasicrystals
- Palindromic complexity of infinite words associated with simple Parry numbers
- On-line digit set conversion in real base.
- \(\beta\)-shift, numeration systems, and automata
- Independent numeration systems and syndeticity
- Ultimate periodicity problem for linear numeration systems
- Confluent linear numeration systems
- A full characterization of Bertrand numeration systems
- Additive and multiplicative properties of point sets based on beta-integers.
- Metric theorems for continued \(\beta\)-fractions
- Regularities of the distribution of \(\beta\)-adic van der Corput sequences
- On multiplicatively dependent linear numeration systems, and periodic points
- Regular sequences and synchronized sequences in abstract numeration systems
- On multiplicative independent bases for canonical number systems in cyclotomic number fields
- The carry propagation of the successor function
- Dynamical directions in numeration
- String attractors of some simple-parry automatic sequences
- An analogue of Cobham's theorem for graph directed iterated function systems
- A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS
- Purely periodic \(\beta \)-expansions in the Pisot non-unit case
- Alternate Base Numeration Systems
- A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems
This page was built for publication: How to write integers in a non-integral basis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q909694)