Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Abelian Anti-Powers in Infinite Words (1810.12275v2)

Published 29 Oct 2018 in math.CO, cs.DM, and cs.FL

Abstract: An abelian anti-power of order $k$ (or simply an abelian $k$-anti-power) is a concatenation of $k$ consecutive words of the same length having pairwise distinct Parikh vectors. This definition generalizes to the abelian setting the notion of a $k$-anti-power, as introduced in [G. Fici et al., Anti-powers in infinite words, J. Comb. Theory, Ser. A, 2018], that is a concatenation of $k$ pairwise distinct words of the same length. We aim to study whether a word contains abelian $k$-anti-powers for arbitrarily large $k$. S. Holub proved that all paperfolding words contain abelian powers of every order [Abelian powers in paper-folding words. J. Comb. Theory, Ser. A, 2013]. We show that they also contain abelian anti-powers of every order.

Citations (6)

Summary

We haven't generated a summary for this paper yet.