How to write integers in a non-integral basis
Let \(d=(d_ n)\), \(n\geq 0\), be a strictly increasing sequence of natural numbers such that \(d_ 0=1\). Then every natural number \(N\) can be written in a unique manner as \(N=\sum^{n}_{j=0}m_ jd_ j\). Then \(L(d)\) denotes the set of all admissible blocks \(m_ n...m_ 1m_ 0\) obtained as expansions of natural numbers. It is shown that \(L(d)\) is the set of all admissible blocks of digits with respect to a \(\beta\)-expansion if and only if \(m_ n...m_ 1m_ 0\in L(d)\) implies \(m_ n...m_ 1m_ 00\in L(d)\). In this case \(\beta =\lim_{n\to \infty} d_{n+1}d_ n^{-1}.\)
- Cubic pisot unit combinatorial games
- Confluent linear numeration systems
- On recognizable sets of integers
- Independent numeration systems and syndeticity
- On the sequentiality of the successor function
- Bertrand numeration systems and recognizability
- Additive and multiplicative properties of point sets based on beta-integers.
- Convergence of Pascal-like triangles in Parry-Bertrand numeration systems
- On-line digit set conversion in real base.
- \(\beta\)-shift, numeration systems, and automata
- Automatic sequences based on Parry or Bertrand numeration systems
- Robustness of Pisot-regular sequences
- Regular sequences and synchronized sequences in abstract numeration systems
- A full characterization of Bertrand numeration systems
- The carry propagation of the successor function
- Metric theorems for continued \(\beta\)-fractions
- An analogue of Cobham's theorem for graph directed iterated function systems
- Dynamical directions in numeration
- Palindromic complexity of infinite words associated with simple Parry numbers
- Purely periodic \(\beta \)-expansions in the Pisot non-unit case
- TWO GROUPS ASSOCIATED WITH QUADRATIC PISOT UNITS
- A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems
- A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS
- AUTOMATIC CONVERSION FROM FIBONACCI REPRESENTATION TO REPRESENTATION IN BASE φ, AND A GENERALIZATION
- On multiplicative independent bases for canonical number systems in cyclotomic number fields
- On multiplicatively dependent linear numeration systems, and periodic points
- Complexity of infinite words associated with beta-expansions
- Ultimate periodicity problem for linear numeration systems
- Linear numeration systems, -developments and finite automata
- Recognizable sets of numbers in nonstandard bases
- Geometric study of the beta-integers for a Perron number and mathematical quasicrystals
- Real numbers having ultimately periodic representations in abstract numeration systems
- Alternate Base Numeration Systems
- String Attractors of Fixed Points of k-Bonacci-Like Morphisms
- String attractors of some simple-parry automatic sequences
- A succinct study of positionality for Dumont-Thomas numeration systems
- Regularities of the distribution of \(\beta\)-adic van der Corput sequences
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)
