REVIEW 1 cited by
Functions on Antipower Prefix Lengths of the Thue-Morse Word
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
We say that a word $w$ of length $kn$ is a $k$-\textit{antipower} if it can be written in the form $w_1 \cdots w_k$, where each $w_i$ is a distinct word of length $n$. We analyze prefixes of the Thue-Morse word $\textbf{t}$ and lengths of antipowers occurring in them. Define $\Gamma(k)$ to be the largest odd $n$ such that the prefix of $\textbf{t}$ of length $kn$ is not a $k$-antipower, and $\gamma(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 $\gamma(k)$ and $\Gamma(k)-\gamma(k)$. Our bounds on $\gamma(k)$ affirmatively answer one conjecture of Defant and make substantial progress towards answering a second conjecture of Defant. It was previously known that $\Gamma(k)$ and $\gamma(k)$ grow linearly in $k$, but our bounds on $\Gamma(k)-\gamma(k)$ prove that $\Gamma(k)-\gamma(k)$ also grows linearly in $k$.
Forward citations
Cited by 1 Pith paper
-
On the cyclic regularities of strings
The paper defines cyclic periodicity and cyclic covers and claims efficient algorithms, but the proofs are inadequate and one central test appears to reject a valid cyclic periodic string.
Discussion (0). Continue with ORCID to comment.