6533b85bfe1ef96bd12bb65f
RESEARCH PRODUCT
Abelian combinatorics on words: A survey
Gabriele FiciSvetlana Puzyninasubject
FOS: Computer and information sciencesDiscrete Mathematics (cs.DM)General Computer ScienceFormal Languages and Automata Theory (cs.FL)Computer Science - Formal Languages and Automata TheoryAbelian combinatorics on word68R15Discrete mathematicsTheoretical Computer ScienceFOS: MathematicsMathematics - CombinatoricsCombinatorics (math.CO)Computer Science - Discrete MathematicsCombinatorics on worddescription
We survey known results and open problems in abelian combinatorics on words. Abelian combinatorics on words is the extension to the commutative setting of the classical theory of combinatorics on words. The extension is based on \emph{abelian equivalence}, which is the equivalence relation defined in the set of words by having the same Parikh vector, that is, the same number of occurrences of each letter of the alphabet. In the past few years, there was a lot of research on abelian analogues of classical definitions and properties in combinatorics on words. This survey aims to gather these results.
year | journal | country | edition | language |
---|---|---|---|---|
2022-07-20 | Computer Science Review |