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

MaRDI QIDQ1010692zbMATH OpenFDO

Authors James D. Currie, Narad Rampersad

Publication date 7 April 2009

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

Full work available at URL https://arxiv.org/abs/0802.4095, https://eudml.org/doc/117202, http://www.emis.de/journals/EJC/Volume_15/Abstracts/v15i1n34.html

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

zbMATH Keywords

combinatorics on wordscritical exponentrepetitions

Mathematics Subject Classification ID

Combinatorics on words (68R15)

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

Review text

Summary: The critical exponent of an infinite word \({\mathbf w}\) is the supremum of all rational numbers \(\alpha\) such that \({\mathbf w}\) contains an \(\alpha\)-power. We resolve an open question of Krieger and Shallit by showing that for each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha\).

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

Cited in

(15)

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

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)