Numeration and discrete dynamical systems

DOI10.1007/s00607-011-0181-9zbMath1269.11009MaRDI QIDQ411444

Valérie Berthé

Publication date: 4 April 2012

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-011-0181-9

zbMATH Keywords

simulation; continued fractions; Lyapunov exponent; Euclidean algorithm; discrete dynamical system; numeration system

Mathematics Subject Classification ID

11J70: Continued fractions and generalizations

11A63: Radix representation; digital problems

37B10: Symbolic dynamics

11K16: Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc.

Related Items

Beta-expansion and continued fraction expansion of real numbers

Uses Software

• SLEEF

Cites Work

• Chaos and continued fractions
• Continued fraction and decimal expansions of an irrational number
• On the number of optimal base 2 representations of integers
• Beta-expansion and continued fraction expansion over formal Laurent series
• Boundary of central tiles associated with Pisot beta-numeration and purely periodic expansions
• Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms
• Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
• Some skew product transformations associated with continued fractions and their invariant measures
• Approximations of real numbers by the sequence \(\{\) n\(\alpha\) \(\}\) and their metrical theory
• Why computers like Lebesgue measure
• Continued fraction algorithms, functional operators, and structure constants
• A central limit theorem related to decimal and continued fraction expansion
• An a priori estimate for the truncation error of a continued fraction expansion to the Gaussian error function
• Best simultaneous Diophantine approximations. II: Behavior of consecutive best approximations
• Ergodic theorems for individual random sequences
• Higher dimensional continued fractions
• What good are numerical simulations of chaotic dynamical systems?
• Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
• On the sequentiality of the successor function
• On continued fraction expansions in positive characteristic: equivalence relations and some metric properties
• Computational ergodic theory
• Euclidean algorithms are Gaussian
• Signed bits and fast exponentiation
• On-line digit set conversion in real base.
• Dynamical directions in numeration
• Vergleich der Genauigkeit von Dezimalbruch und Kettenbruch
• Exact arithmetic on the Stern-Brocot tree
• Beta-expansion and continued fraction expansion
• An iterated logarithm law related to decimal and continued fraction expansions
• Gaussian laws for the main parameters of the Euclid algorithms
• Euclidean dynamics
• Die ersten 968 Kettenbruchnenner von \(\pi\)
• Equipartition of interval partitions and an application to number theory
• Analysis of linear combination algorithms in cryptography
• Distribution of closed geodesics on the modular surface and quadratic irrationals
• A new multidimensional continued fraction algorithm
• Representations for real numbers and their ergodic properties
• Partial quotients of continued fractions and β-expansions
• Topological chaos: what may this mean?
• Handbook of Floating-Point Arithmetic
• The Computational Complexity of Simultaneous Diophantine Approximation Problems
• On Periodic Expansions of Pisot Numbers and Salem Numbers
• Best Simultaneously Diophantine Approximations. I. Growth Rates of Best Approximation Denominators
• Continued Fractions and Chaos
• On-line finite automata for addition in some numeration systems
• On decimal and continued fraction expansions of a real number
• Some characterizations of functions computable in on-line arithmetic
• Odometers and systems of numeration
• An Introduction to Symbolic Dynamics and Coding
• Fractions continues multidimensionnelles et lois stables
• Efficient and Reliable Multiprecision Implementation of Elementary and Special Functions
• Entropy quotients and correct digits in number-theoretic expansions
• Number representation and finite automata
• Absolutely Continuous Invariant Measures that Cannot be Observed Experimentally
• Mathematical Foundations of Computer Science 2005
• Exposants caractéristiques de l'algorithme de Jacobi-Perron et de la transformation associée. (Characteristic exponents of the Jacobi-Perron algorithm and of the associated map)
• On minimal expansions in redundant number systems: Algorithms and quantitative analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item