String matching is one of the oldest algorithmic techniques, yet still one of the most
pervasive in computer science. The past 20 years have seen technological leaps in …

A k-antipower (for k ≥ 2) is a concatenation of k pairwise distinct words of the same length.
The study of antipower factors of a word was initiated by Fici et al.(ICALP 2016) and first …

Abstract A string S [1, n] is a power (or repetition or tandem repeat) of order k and period n/k,
if it can be decomposed into k consecutive identical blocks of length n/k. Powers and periods …

The definition of antipower introduced by Fici et al.(ICALP 2016) captures the notion of being
the opposite of a power: a sequence of k pairwise distinct blocks of the same length …

A k-anticover of a string x is a set of pairwise distinct factors of x of equal length k, such that
every symbol of x is contained into an occurrence of at least one of those factors. The …

A finite word is called ak-power if it is of the form wk for some word w. A particularly famous
consequence of the study of k-powers is Axel Thue's 1912 paper Thue (1912), which …

Fici et al. recently introduced the notion of anti-powers in the context of combinatorics on
words. A power (also called tandem repeat) is a sequence of consecutive identical blocks …

We investigate properties and applications of a new compact representation of string factors:
families of packages. In a string T, each package (i, ℓ, k) represents the factors of T of length …

In this paper, we study local maximal antiperiodicities. Given a string X and an integer k, we
compute the maximal k-antiperiodicity starting at every position of X; that is, we identify a …

In a recent work, A. Berger and C. Defant showed that if $ x $ is a fixed point of a binary
uniform and primitive morphism, then there exists a constant $ C $ such that for all positive …