\((k,\lambda)\)-anti-powers and other patterns in words (Q1630893)

A \((k, \lambda)\)-anti-power, as defined in [\textit{C. Defant}, Electron. J. Comb. 24, No. 1, Research Paper P1.32, 17 p. (2017; Zbl 1355.05005)], is a word \(w\) of the form \(w = w_1w_2 \cdots w_k\) such that \(|w_1|=\ldots=|w_k|\) and \(|\{i : w_i =w_j\}|\leq \lambda\) for each fixed \(j\in \{1,\ldots,k\}\). For \(\lambda =1\), this becomes the notion of a \(k\)-anti-power defined in [\textit{G. Fici} et al., J. Comb. Theory, Ser. A 157, 109--119 (2018; Zbl 1393.68141)], that is, a concatenation of \(k\) pairwise-distinct blocks of the same length. The author extends some of the known results on anti-powers to the case of \((k, \lambda)\)-anti-powers.