5-Abelian cubes are avoidable on binary alphabets

Tietueen suppeat tiedot
dc.contributor.authorMercas R
dc.contributor.authorSaarela A
dc.contributor.organizationfi=matematiikka|en=Mathematics|
dc.contributor.organization-code1.2.246.10.2458963.20.41687507875
dc.converis.publication-id3122378
dc.converis.urlhttps://research.utu.fi/converis/portal/Publication/3122378
dc.date.accessioned2022-10-28T12:30:34Z
dc.date.available2022-10-28T12:30:34Z
dc.description.abstract<p> A k-abelian cube is a word uvw, where the factors u, v, and w are either pairwise equal, or have the same multiplicities for every one of their factors of length at most k. Previously it has been shown that k-abelian cubes are avoidable over a binary alphabet for k &gt;= 8. Here it is proved that this holds for k &gt;= 5.</p>
dc.format.pagerange467
dc.format.pagerange478
dc.identifier.jour-issn0988-3754
dc.identifier.olddbid176918
dc.identifier.oldhandle10024/160012
dc.identifier.urihttps://www.utupub.fi/handle/11111/32621
dc.identifier.urlhttp://www.rairo-ita.org/articles/ita/abs/2014/04/ita140019/ita140019.html
dc.identifier.urnURN:NBN:fi-fe2021042715069
dc.language.isoen
dc.okm.affiliatedauthorSaarela, Aleksi
dc.okm.discipline111 Mathematicsen_GB
dc.okm.discipline111 Matematiikkafi_FI
dc.okm.internationalcopublicationinternational co-publication
dc.okm.internationalityInternational publication
dc.okm.typeA1 ScientificArticle
dc.publisherEDP Sciences
dc.relation.doi10.1051/ita/2014020
dc.relation.ispartofjournalRAIRO: Informatique Théorique et Applications / RAIRO: Theoretical Informatics and Applications
dc.relation.issue4
dc.relation.volume48
dc.source.identifierhttps://www.utupub.fi/handle/10024/160012
dc.title5-Abelian cubes are avoidable on binary alphabets
dc.year.issued2014

Tiedostot

Näytetään 1 - 1 / 1
Name:
mesa14ita.pdf
Size:
593.42 KB
Format:
Adobe Portable Document Format
Lataa

Kokoelmat

Rinnakkaistallenteet