All growth rates of abelian exponents are attained by infinite binary words

dc.contributor.authorPeltomäki Jarkko
dc.contributor.authorWhiteland Markus A.
dc.contributor.organizationfi=matematiikka|en=Mathematics|
dc.contributor.organization-code1.2.246.10.2458963.20.41687507875
dc.converis.publication-id48627207
dc.converis.urlhttps://research.utu.fi/converis/portal/Publication/48627207
dc.date.accessioned2022-10-28T14:39:56Z
dc.date.available2022-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.pagerange79:1
dc.format.pagerange79:10
dc.identifier.isbn978-3-95977-159-7
dc.identifier.jour-issn1868-8969
dc.identifier.olddbid189564
dc.identifier.oldhandle10024/172658
dc.identifier.urihttps://www.utupub.fi/handle/11111/40501
dc.identifier.urnURN:NBN:fi-fe2021042827484
dc.language.isoen
dc.okm.affiliatedauthorPeltomäki, Jarkko
dc.okm.discipline111 Mathematicsen_GB
dc.okm.discipline111 Matematiikkafi_FI
dc.okm.internationalcopublicationinternational co-publication
dc.okm.internationalityInternational publication
dc.okm.typeA4 Conference Article
dc.publisher.countryGermanyen_GB
dc.publisher.countrySaksafi_FI
dc.publisher.country-codeDE
dc.relation.conferenceInternational Symposium on Mathematical Foundations of Computer Science
dc.relation.doi10.4230/LIPIcs.MFCS.2020.79
dc.relation.ispartofjournalLIPICS – Leibniz international proceedings in informatics
dc.relation.ispartofseriesLIPICS – Leibniz international proceedings in informatics
dc.relation.volume170
dc.source.identifierhttps://www.utupub.fi/handle/10024/172658
dc.titleAll growth rates of abelian exponents are attained by infinite binary words
dc.title.book45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
dc.year.issued2020

Tiedostot

Näytetään 1 - 1 / 1
Ladataan...
Name:
LIPIcs-MFCS-2020-79.pdf
Size:
458.97 KB
Format:
Adobe Portable Document Format
Description:
Publisher's PDF