Abstract

An abelian circular square is a string of characters such that both halves are cyclic permutations of each other; equivalently, their Parikh vectors are equal. We examine the number of distinct non-trivial abelian circular squares associated with binary partial words. This includes algorithms to calculate this number and formulas that predict it.

Keywords: Combinatorics on Words; Partial Words; Abelian Circular Squares