Functions on antipower prefix lengths of the Thue-Morse word

DOI10.1016/J.DISC.2019.111675zbMATH Open1429.05006arXiv1705.06310OpenAlexW2978963098WikidataQ127216661 ScholiaQ127216661MaRDI QIDQ2279999FDOQ2279999

Authors: Shyam Narayanan

Publication date: 17 December 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: We say that a word

w

of length

k n

is a

k

- extit{antipower} if it can be written in the form

w_{1} c d o t s w_{k}

, where each

w_{i}

is a distinct word of length

n

. We analyze prefixes of the Thue-Morse word

e x t b f t

and lengths of antipowers occurring in them. Define

G a m m a (k)

to be the largest odd

n

such that the prefix of

e x t b f t

of length

k n

is not a

k

-antipower, and

g a m m a (k)

to be the smallest odd

n

such that the corresponding prefix is a

k

-antipower. We provide strong bounds on the asymptotic values of

g a m m a (k)

and

G a m m a (k) - g a m m a (k)

. Our bounds on

g a m m a (k)

affirmatively answer one conjecture of Defant and make substantial progress towards answering a second conjecture of Defant. It was previously known that

G a m m a (k)

and

g a m m a (k)

grow linearly in

k

, but our bounds on

G a m m a (k) - g a m m a (k)

prove that

G a m m a (k) - g a m m a (k)

also grows linearly in

k

.

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

Recommendations

zbMATH Keywords

Thue-Morse word infinite word antipower

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics on words (68R15)

Cites Work

Cited In (5)

This page was built for publication: Functions on antipower prefix lengths of the Thue-Morse word

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