Repetition avoidance in products of factors

DOI10.1016/J.TCS.2019.04.013MaRDI QIDQ2272409zbMATH OpenOpenAlexWikidataFDO

Authors Pamela Fleischmann, Pascal Ochem, Kamellia Reshadi

Publication date 10 September 2019

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1809.01426

zbMATH Keywords

combinatorics on words repetition avoidance

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Abstract: We consider a variation on a classical avoidance problem from combinatorics on words that has been introduced by Mousavi and Shallit at DLT 2013. Let

e x t t t {p e x p}_{i} (w)

be the supremum of the exponent over the products of

i

factors of the word

w

. The repetition threshold

e x t t t {R T}_{i} (k)

is then the infimum of

e x t t t {p e x p}_{i} (w)

over all words

w i n S i g m a^{o} m e g a_{k}

. Mousavi and Shallit obtained that

e x t t t {R T}_{i} (2) = 2 i

and

e x t t t {R T}_{2} (3) = f r a c 134

. We show that

e x t t t {R T}_{i} (3) = f r a c 3 i 2 + f r a c 14

if

i

is even and

e x t t t {R T}_{i} (3) = f r a c 3 i 2 + f r a c 16

if

i

is odd and

i g e 3

.

Recommendations

Cites work

Cited in

(1)

Repetition avoidance in circular factors

This page was built for publication: Repetition avoidance in products of factors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272409)