All growth rates of abelian exponents are attained by infinite binary words
| dc.contributor.author | Peltomäki Jarkko | |
| dc.contributor.author | Whiteland Markus A. | |
| dc.contributor.organization | fi=matematiikka|en=Mathematics| | |
| dc.contributor.organization-code | 1.2.246.10.2458963.20.41687507875 | |
| dc.converis.publication-id | 48627207 | |
| dc.converis.url | https://research.utu.fi/converis/portal/Publication/48627207 | |
| dc.date.accessioned | 2022-10-28T14:39:56Z | |
| dc.date.available | 2022-10-28T14:39:56Z | |
| dc.description.abstract | <p>We consider repetitions in infinite words by making a novel inquiry to the maximum eventual growth rate of the exponents of abelian powers occurring in an infinite word. Given an increasing, unbounded function $f\colon \N \to \R$, we construct an infinite binary word whose abelian exponents have limit superior growth rate $f$. As a consequence, we obtain that every nonnegative real number is the critical abelian exponent of some infinite binary word.<br /></p> | |
| dc.format.pagerange | 79:1 | |
| dc.format.pagerange | 79:10 | |
| dc.identifier.isbn | 978-3-95977-159-7 | |
| dc.identifier.jour-issn | 1868-8969 | |
| dc.identifier.olddbid | 189564 | |
| dc.identifier.oldhandle | 10024/172658 | |
| dc.identifier.uri | https://www.utupub.fi/handle/11111/40501 | |
| dc.identifier.urn | URN:NBN:fi-fe2021042827484 | |
| dc.language.iso | en | |
| dc.okm.affiliatedauthor | Peltomäki, Jarkko | |
| dc.okm.discipline | 111 Mathematics | en_GB |
| dc.okm.discipline | 111 Matematiikka | fi_FI |
| dc.okm.internationalcopublication | international co-publication | |
| dc.okm.internationality | International publication | |
| dc.okm.type | A4 Conference Article | |
| dc.publisher.country | Germany | en_GB |
| dc.publisher.country | Saksa | fi_FI |
| dc.publisher.country-code | DE | |
| dc.relation.conference | International Symposium on Mathematical Foundations of Computer Science | |
| dc.relation.doi | 10.4230/LIPIcs.MFCS.2020.79 | |
| dc.relation.ispartofjournal | LIPICS – Leibniz international proceedings in informatics | |
| dc.relation.ispartofseries | LIPICS – Leibniz international proceedings in informatics | |
| dc.relation.volume | 170 | |
| dc.source.identifier | https://www.utupub.fi/handle/10024/172658 | |
| dc.title | All growth rates of abelian exponents are attained by infinite binary words | |
| dc.title.book | 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020) | |
| dc.year.issued | 2020 |
Tiedostot
1 - 1 / 1
Ladataan...
- Name:
- LIPIcs-MFCS-2020-79.pdf
- Size:
- 458.97 KB
- Format:
- Adobe Portable Document Format
- Description:
- Publisher's PDF