How to write integers in a non-integral basis
From MaRDI portal
Publication:909694
DOI10.1007/BF01952053zbMath0695.10005MaRDI QIDQ909694
Publication date: 1989
Published in: Acta Mathematica Hungarica (Search for Journal in Brave)
Radix representation; digital problems (11A63) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16)
Related Items
Dynamical directions in numeration, Palindromic complexity of infinite words associated with simple Parry numbers, On multiplicatively dependent linear numeration systems, and periodic points, Complexity of infinite words associated with beta-expansions, Ultimate periodicity problem for linear numeration systems, \(\beta\)-shift, numeration systems, and automata, A full characterization of Bertrand numeration systems, Real numbers having ultimately periodic representations in abstract numeration systems, On the sequentiality of the successor function, On Multiplicative Independent Bases for Canonical Number Systems in Cyclotomic Number Fields, Linear numeration systems, θ-developments and finite automata, Recognizable sets of numbers in nonstandard bases, Bertrand numeration systems and recognizability, Additive and multiplicative properties of point sets based on beta-integers., Alternate Base Numeration Systems, String Attractors of Fixed Points of k-Bonacci-Like Morphisms, The carry propagation of the successor function, Purely periodic \(\beta \)-expansions in the Pisot non-unit case, Convergence of Pascal-like triangles in Parry-Bertrand numeration systems, Confluent linear numeration systems, Automatic sequences based on Parry or Bertrand numeration systems, Geometric study of the beta-integers for a Perron number and mathematical quasicrystals, TWO GROUPS ASSOCIATED WITH QUADRATIC PISOT UNITS, Robustness of Pisot-regular sequences, Metric theorems for continued \(\beta\)-fractions, A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems, Cubic pisot unit combinatorial games, On recognizable sets of integers, A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS, Independent numeration systems and syndeticity, Regular sequences and synchronized sequences in abstract numeration systems, On-line digit set conversion in real base., An analogue of Cobham's theorem for graph directed iterated function systems, AUTOMATIC CONVERSION FROM FIBONACCI REPRESENTATION TO REPRESENTATION IN BASE φ, AND A GENERALIZATION
Cites Work
