The combinatorics of nonstandard squares in a word depends on how the equivalence of halves of the square is defined. We consider Abelian squares, parameterized squares, and order-preserving squares. The word $uv$ is an Abelian (parameterized, order-preserving) square if $u$ and $v$ are equivalent in the Abelian (parameterized, order-preserving) sense. The maximum number of ordinary squares in a word is known to be asymptotically linear, but the exact bound is still investigated. We present several results on the maximum number of distinct squares for nonstandard factor equivalence relations. Let $SQAbel(n,\sigma)$ denote the maximum number of Abelian squares in a word of length n over an alphabet of size $\sigma$ which are distinct as words and which are nonequivalent in the Abelian sense, respectively. For $\sigma\ge 2$ we prove that $SQAbel(n,\sigma)=\Theta(n^2)$. We also give linear bounds for parameterized and order-preserving squares for alphabets of constant size: $SQparam(n,O(1))=\Theta(n)$, $SQop(n,O(1))=\Theta(n)$. The upper bounds have quadratic dependence on the alphabet size for order-preserving squares and exponential dependence for parameterized squares. As a side result we construct infinite words over the smallest alphabet which avoid nontrivial order-preserving squares and nontrivial parameterized cubes (nontrivial parameterized squares cannot be avoided in an infinite word). A preliminary version of this paper was published at DLT 2014. In this full version we improve or extend the bounds on all three kinds of squares.

Publication

Theoretical Computer Science 648:84-95

Date

September, 2016

Type

Journal
(see conference version)

Links