Tight bounds on the number of non-equivalent parameterized squares in a word

Rikuya Hamai, Kazushi Taketsugu, Yuto Nakashima +3

Two words $x,y$ of the same length are said to be \emph{parameterized equivalent} if there exists a character bijection that transforms $x$ into $y$. A word $w$ is called a paramet…