Analysis of generalized continued fraction algorithms over polynomials

DOI10.1016/j.ffa.2021.101849zbMath1472.11207OpenAlexW3157802280MaRDI QIDQ2031651

Rie Natsui, Hitoshi Nakada, Brigitte Vallée, Valérie Berthé

Publication date: 10 June 2021

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2021.101849

zbMATH Keywords

generating functionsdynamical systemsHaar measuretransfer operatorsanalytic combinatoricsLaurent formal power seriesmultidimensional continued fractionsGaussian lawscosts and bit-complexitiesgcd algorithms for polynomials over finite fields

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Exact enumeration problems, generating functions (05A15) Metric theory of other algorithms and expansions; measure and Hausdorff dimension (11K55) Continued fractions and generalizations (11J70) Metric theory of continued fractions (11K50) Relations between ergodic theory and number theory (37A44)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the thermodynamic formalism for the Gauss map
• The convergence of the generalised Selmer algorithm
• Probabilistic analyses of the plain multiple gcd algorithm
• Metric properties and exceptional sets of \(\beta \)-expansions over formal Laurent series
• Convergence of the Brun algorithm over the field of formal power series
• Non-negative matrices and Markov chains. 2nd ed
• On convergence rates in the central limit theorems for combinatorial structures
• The modified Jacobi-Perron algorithm over \(\mathbb F_q (X)^d\)
• On continued fraction expansions in positive characteristic: equivalence relations and some metric properties
• On Schweiger's problems on fully subtractive algorithms
• Euclidean algorithms are Gaussian
• The three-dimensional Poincaré continued fraction algorithm
• The Brun gcd algorithm in high dimensions is almost always subtractive
• Fine costs for Euclid's algorithm on polynomials and Farey maps
• Gaussian laws for the main parameters of the Euclid algorithms
• Euclidean dynamics
• The exact length of the Euclidean algorithm in [ X ]
• On the sum of degrees of digits occurring in continued fraction expansions of Laurent series
• The statistics of continued fractions for polynomials over a finite field
• Interval exchange transformations

This page was built for publication: Analysis of generalized continued fraction algorithms over polynomials