Subword enumeration up to stack-sorting equivalence

TL;DR

This paper explores generalizations of the stack-sorting map for words, extending abelian complexity functions and revealing structural properties of infinite words like Thue-Morse and paperfolding.

Contribution

It introduces a natural extension of abelian complexity functions using Defant-Kravitz operations, linking stack-sorting concepts with combinatorics on words.

Findings

Extended abelian complexity functions for infinite sequences.

Discovered connections between Thue-Morse factors and previous research.

Provided a new interdisciplinary framework linking stack-sorting and combinatorics on words.

Abstract

Defant and Kravitz introduced generalizations of West's stack-sorting map $s$ from permutations to finite words. This raises questions as to how such generalizations could be applied in the field of combinatorics on words. The Defant-Kravitz generalizations of $s$ depend on how repeated occurrences of the same character within a word may be repositioned, according to their $\textsf{tortoise}$ and $\textsf{hare}$ operations. As demonstrated in this paper, these operations provide a natural way of extending abelian complexity functions for infinite sequences, in a way that gives light to structural properties associated with infinite words. We apply these new ideas to two famous infinite words: the paperfolding word and the Thue-Morse word. In the case of the Thue-Morse word, we discover an interesting connection to the previous work of several authors, such as de Luca and Varricchio, on the ``special'' factors of the Thue-Morse word. This may be seen as providing a basis for a new and interdisciplinary area linking the combinatorics about the stack-sorting of permutations with the field of combinatorics on words.