On Dejean's conjecture over large alphabets

DOI10.1016/J.TCS.2007.06.001MaRDI QIDQ2456366zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Arturo Carpi

Publication date 18 October 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2007.06.001

zbMATH Keywords

repetition thresholdDejean conjecturefractional repetition

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• On the Repetition Threshold for Large Alphabets
• Last cases of Dejean's conjecture
• Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
• On two stronger versions of Dejean's conjecture
• Dejean's conjecture and letter frequency

Cites work

• scientific article; zbMATH DE number 5604082 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
• Dejean's conjecture and Sturmian words
• MUTUALLY AVOIDING TERNARY WORDS OF SMALL EXPONENT
• On the Repetition Threshold for Large Alphabets
• Polynomial versus exponential growth in repetition-free binary words
• Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
• SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS
• Sur un théorème de Thue
• Uniformly growing k-th power-free homomorphisms

Cited in

(57)

• On the existence of minimal -powers
• scientific article; zbMATH DE number 1051238 (Why is no real title available?)
• A small morphism for which the fixed point has an abelian critical exponent less than 2
• Minimal critical exponent of quasiperiodic words
• ON THE REPETITIVITY INDEX OF INFINITE WORDS
• Branching frequency and Markov entropy of repetition-free languages
• Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture
• Last cases of Dejean's conjecture
• Transition Property for $$\alpha $$-Power Free Languages with $$\alpha \ge 2$$ and $$k\ge 3$$ Letters
• The repetition threshold of episturmian sequences
• The undirected repetition threshold and undirected pattern avoidance
• The asymptotic repetition threshold of sequences rich in palindromes
• Bounds for the generalized repetition threshold
• Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings
• Asymptotic repetitive threshold of balanced sequences
• Growth rates of complexity of power-free languages
• On minimal critical exponent of balanced sequences
• Dejean's conjecture and letter frequency
• scientific article; zbMATH DE number 851423 (Why is no real title available?)
• Dejean's conjecture and letter frequency
• Fractional meanings of nonrepetitiveness
• On repetition thresholds of caterpillars and trees of bounded degree
• (2+ )-nonrepetitive list colouring of paths
• Counting maximal-exponent factors in words
• On the Repetition Threshold for Large Alphabets
• On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\)
• Subword complexity and power avoidance
• Extensions and reductions of squarefree words
• AVOIDING APPROXIMATE SQUARES
• Nonrepetitive list colorings of the integers
• Dejean's conjecture holds for \(n\geq 30\)
• A generalization of Thue freeness for partial words
• On a word avoiding near repeats
• The weak circular repetition threshold over large alphabets
• On the growth rates of complexity of threshold languages
• Growth properties of power-free languages
• Repetition avoidance in products of factors
• On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
• An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence
• Approaching repetition thresholds via local resampling and entropy compression
• A proof of Dejean’s conjecture
• Words avoiding tangrams
• On extremal properties of the Fibonacci word
• Extremal overlap-free and extremal -free binary words
• Growth of power-free languages over large alphabets
• On Pnsiot words avoiding 3-repetitions
• Dejean's conjecture holds for N ≥ 27
• Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers
• Critical exponent of infinite balanced words via the Pell number system
• Non-constructive upper bounds for repetition thresholds
• Critical Exponents of Regular Arnoux-Rauzy Sequences
• On Abelian repetition threshold
• The repetition threshold for ternary rich words
• The number of threshold words on \(n\) letters grows exponentially for every \(n \geq 27\)
• The repetition threshold for binary rich words
• Highly nonrepetitive sequences: winning strategies from the local Lemma
• Abelian repetition threshold revisited

This page was built for publication: On Dejean's conjecture over large alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2456366)