Optimal number representations in negative base
From MaRDI portal
Abstract: For a given base and a digit set we consider optimal representations of a number , as defined by Dajani at al. in 2012. For a non-integer negative base and the digit set we derive the transformation which generates the optimal representation, if it exists. We show that -- unlike the case of negative integer base -- almost no has an optimal representation. For a positive base and the alphabet we provide an alternative proof of statements obtained by Dajani et al.
Recommendations
- Greedy and lazy representations in negative base systems
- Optimal expansions in non-integer bases
- Optimal expansions in noninteger bases. II
- Substitutions over infinite alphabet generating \((-\beta)\)-integers
- Subblock Occurrences in Positional Number Systems and Gray code Representation
- Substitutions over infinite alphabet generating \((-\beta)\)-integers
- Zeroless Positional Number Representation and String Ordering
- Substitutive number systems
- Greedy numeration systems and regularity
- Counting optimal joint digit expansions
Cites work
- Almost Every Number Has a Continuum of b-Expansions
- Calculating the numbers of representations and the Garsia entropy in linear numeration systems
- Characterization of the unique expansions $1=\sum^{\infty}_{i=1}q^{-n_ i}$ and related problems
- Comments on the spectra of Pisot numbers
- Complexity of infinite words associated with beta-expansions
- Confluent linear numeration systems
- Ergodic Transformations from an Interval Into Itself
- Greedy expansions and sets with deleted digits
- On theβ-expansions of real numbers
- Optimal expansions in non-integer bases
- Representations for real numbers and their ergodic properties
- Symmetric shift radix systems and finite expansions
- Symmetrized \(\beta \)-integers
Cited in
(2)
This page was built for publication: Optimal number representations in negative base
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448975)