Asymptotic repetitive threshold of balanced sequences

DOI10.1090/mcom/3816OpenAlexW4312046056MaRDI QIDQ5879125

Daniela Opočenská, Edita Pelantová, L'ubomíra Dvořáková

Publication date: 24 February 2023

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.00366

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (1)

An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Last cases of Dejean's conjecture
• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
• Dejean's conjecture and Sturmian words
• Every real number greater than 1 is a critical exponent
• Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
• On repetitions of blocks in binary sequences
• The index of Sturmian sequences
• A characterization of substitutive sequences using return words
• Well-balanced sequences
• Special factors, periodicity, and an application to Sturmian words
• Episturmian words and episturmian morphisms
• On balanced sequences and their critical exponent
• Critical exponent of infinite balanced words via the Pell number system
• Natural exact covering systems and the reversion of the Möbius series
• Critical exponents of infinite balanced words
• On Dejean's conjecture over large alphabets
• On exactly covering systems of arithmetic sequences
• Sur un théorème de Thue
• On minimal critical exponent of balanced sequences
• Finite-Repetition threshold for infinite ternary words
• On Two Stronger Versions of Dejean’s Conjecture
• SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS
• A Note on Disjoint Covering Systems—Variations on a 2002 AIME Problem
• A proof of Dejean’s conjecture
• Simple twisted group algebras of dimension $p^4$ and their semi-centers
• Complementary symmetric Rote sequences: the critical exponent and the recurrence function
• Regular coverings of the integers by arithmetic progressions
• Symbolic Dynamics II. Sturmian Trajectories
• A characterization of Sturmian words by return words

This page was built for publication: Asymptotic repetitive threshold of balanced sequences