Maximal continuants and the Fine-Wilf theorem
From MaRDI portal
Publication:2484507
DOI10.1016/J.JCTA.2004.11.008zbMath1079.68083OpenAlexW1983546375MaRDI QIDQ2484507
Publication date: 1 August 2005
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2004.11.008
Beatty sequencesPartially ordered setsBalanced wordsBackward continued fractionCombinatorial inequalitiesEuclidean-type algorithmSemiregular continued fraction
Nonnumerical algorithms (68W05) Combinatorics on words (68R15) Combinatorics of partially ordered sets (06A07) Combinatorial inequalities (05A20) Continued fractions and generalizations (11J70)
Related Items (3)
Continuants with equal values, a combinatorial approach ⋮ Extremal values of semi‐regular continuants and codings of interval exchange transformations ⋮ A local-global theorem on periodic maps
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The geometry of Markoff numbers
- Intertwinings of periodic sequences
- Analysis of a left-shift binary GCD algorithm
- On the dynamics of the extension of a singular shift.
- Fine and Wilf words for any periods
- More on inhomogeneous Diophantine approximation
- Transcendence of Sturmian or morphic continued fractions
- Extremal values of continuants and transcendence of certain continued fractions
- Some Combinatorial Extremum Problems
- Some metrical properties of continued fractions
- Extremal Values of Continuants
- Continuants with bounded digits
- CONTINUED FRACTIONS WITH BOUNDED PARTIAL QUOTIENTS
- Multi-dimensional versions of a theorem of Fine and Wilf and a formula of Sylvester
- Backward Continued Fractions and their Invariant Measures
- Uniqueness Theorems for Periodic Functions
- Support polygons and the resolution of modular functional singularities
This page was built for publication: Maximal continuants and the Fine-Wilf theorem