Search arXivSearch

arXiv · 1705.06310

Functions on Antipower Prefix Lengths of the Thue-Morse Word

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 $Γ(k)$ to be the largest odd $n$ such that the prefix of $\textbf{t}$ of length $kn$ is not a $k$-antipower, and $γ(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 $γ(k)$ and $Γ(k)-γ(k)$. Our bounds on $γ(k)$ affirmatively answer one conjecture of Defant and make substantial progress towards answering a second conjecture of Defant. It was previously known that $Γ(k)$ and $γ(k)$ grow linearly in $k$, but our bounds on $Γ(k)-γ(k)$ prove that $Γ(k)-γ(k)$ also grows linearly in $k$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shyam Narayanan. 2019-09-28. Functions on Antipower Prefix Lengths of the Thue-Morse Word. https://arxiv.org/abs/1705.06310

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO