For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \) (Q1010692)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: For each > 2 there is an infinite binary word with critical exponent |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \) |
scientific article |
Statements
For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \) (English)
0 references
7 April 2009
0 references
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\).
0 references
combinatorics on words
0 references
repetitions
0 references
critical exponent
0 references
0.8515396118164062
0 references
0.8486160039901733
0 references
0.8464854955673218
0 references
0.833725094795227
0 references
0.8140345215797424
0 references