For each > 2 there is an infinite binary word with critical exponent

zbMATH Open1183.68439arXiv0802.4095MaRDI QIDQ1010692FDOQ1010692

Authors: James D. Currie, Narad Rampersad 

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: For each $alpha>2$ there is a binary word with critical exponent $alpha$.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Critical exponents of words over 3 letters
• Every real number greater than 1 is a critical exponent
• Critical exponents of infinite balanced words
• On Critical Exponents in Fixed Points of Binary k-Uniform Morphisms
• The critical exponent functions

zbMATH Keywords

combinatorics on wordscritical exponentrepetitions

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cited In (14)

• The repetition threshold of episturmian sequences
• Critical exponents of words over 3 letters
• Kolmogorov Complexity, Lovász Local Lemma and Critical Exponents
• Every real number greater than 1 is a critical exponent
• The critical exponent functions
• On Critical Exponents in Fixed Points of Binary k-Uniform Morphisms
• On Critical exponents in fixed points ofk-uniform binary morphisms
• Squares and cubes in Sturmian sequences
• Critical exponents of infinite balanced words
• On square factors and critical factors of \(k\)-bonacci words on infinite alphabet
• Binary words with a given Diophantine exponent
• Enumeration of irreducible binary words
• The critical exponent of the Arshon words
• Critical exponent of infinite balanced words via the Pell number system

This page was built for publication: For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \)

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