Abelian combinatorics on words: a survey
From MaRDI portal
Publication:6101322
Abstract: 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.
Recommendations
Cites work
- \(k\)-abelian equivalence and rationality
- A characterization of Sturmian words by return words
- A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences
- A note on abelian returns in rotation words
- A powerful abelian square-free substitution over 4 letters
- A proof of Dejean’s conjecture
- A square root map on Sturmian words
- Abelian antipowers in infinite words
- Abelian bordered factors and periodicity
- Abelian borders in binary words
- Abelian closures of infinite binary words
- Abelian complexity and synchronization
- Abelian complexity function of the Tribonacci word
- Abelian complexity of fixed point of morphism 0 012, 1 02, 2 1
- Abelian complexity of minimal subshifts
- Abelian maximal pattern complexity of words
- Abelian periods of factors of Sturmian words
- Abelian powers and repetitions in Sturmian words
- Abelian powers in paper-folding words
- Abelian primitive words
- Abelian squares are avoidable on 4 letters
- Abelian-square-rich words
- An abelian periodicity lemma
- An Introduction to Symbolic Dynamics and Coding
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Anti-powers in infinite words
- Aperiodic two-dimensional words of small abelian complexity
- Asymptotic abelian complexities of certain morphic binary words
- Automatic Sequences
- Avoidability of Additive Cubes over Alphabets of Four Numbers
- Avoidability of long k-abelian repetitions
- Avoidable patterns in strings of symbols
- Avoiding 2-binomial squares and cubes
- Avoiding abelian powers cyclically
- AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
- Avoiding or limiting regularities in words
- Avoiding patterns in the abelian sense
- Avoiding three consecutive blocks of the same size and same sum
- Avoiding two consecutive blocks of same size and same sum over \(\mathbb{Z}^2\)
- Balance and abelian complexity of the Tribonacci word
- Balances for fixed points of primitive substitutions.
- Binomial complexities and Parikh-collinear morphisms
- BLOCKING SETS OF TERMS
- Combinatoire de mots récurrents de complexitén+2
- Combinatorics, Words and Symbolic Dynamics
- Computing abelian complexity of binary uniform morphic words
- Counting abelian squares
- Covering the positive integers by disjoint sets of the form \(\{[n\alpha+\beta]: n=1,2,\dots \}\)
- Dyck Words, Lattice Paths, and Abelian Borders
- Enumerating abelian returns to prefixes of Sturmian words
- Episturmian words and some constructions of de Luca and Rauzy
- Every binary pattern of length greater than 14 is abelian-2-avoidable
- Every real number greater than 1 is a critical exponent
- Everywhere -repetitive sequences and Sturmian words
- Fine and Wilf's theorem for \(k\)-abelian periods
- Fixed points avoiding abelian k-powers
- Formal Languages, Automata and Numeration Systems 1
- How many squares can a string contain?
- scientific article; zbMATH DE number 2186883 (Why is no real title available?)
- scientific article; zbMATH DE number 1809720 (Why is no real title available?)
- scientific article; zbMATH DE number 3162927 (Why is no real title available?)
- scientific article; zbMATH DE number 3864526 (Why is no real title available?)
- scientific article; zbMATH DE number 3871492 (Why is no real title available?)
- scientific article; zbMATH DE number 5605094 (Why is no real title available?)
- scientific article; zbMATH DE number 5707089 (Why is no real title available?)
- scientific article; zbMATH DE number 41838 (Why is no real title available?)
- scientific article; zbMATH DE number 3608306 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 2051154 (Why is no real title available?)
- scientific article; zbMATH DE number 1498637 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 2183071 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 7559450 (Why is no real title available?)
- scientific article; zbMATH DE number 6272378 (Why is no real title available?)
- scientific article; zbMATH DE number 3296252 (Why is no real title available?)
- scientific article; zbMATH DE number 3375509 (Why is no real title available?)
- If a DOL language is k-power free then it is circular
- Imbalances in Arnoux-Rauzy sequences
- Infinite self-shuffling words
- Infinite words with linear subword complexity
- Introducing privileged words: privileged complexity of Sturmian words
- Last cases of Dejean's conjecture
- Least Periods of Factors of Infinite Words
- Long binary patterns are abelian 2-avoidable
- Maximal pattern complexity of words over \(\ell\) letters
- Maximum number of distinct and nonequivalent nonstandard squares in a word
- On \(k\)-abelian equivalence and generalized Lagrange spectra
- On k-abelian palindromes
- On a generalization of abelian equivalence and complexity of infinite words
- ON ABELIAN POWER-FREE MORPHISMS
- On Abelian repetition threshold
- On abelian subshifts
- On abelian versions of critical factorization theorem
- On cardinalities of \(k\)-abelian equivalence classes
- On certain sequences of lattice points
- On Context-Free Languages
- On highly palindromic words
- On highly palindromic words: the \(n\)-ary case
- On nonrepetitive sequences
- On some generalizations of abelian power avoidability
- On the asymptotic abelian complexity of morphic words
- On the average number of regularities in a word
- On the number of \(k\)-powers in a finite word
- On the number of abelian bordered words (with an example of automatic theorem-proving)
- On the number of Abelian square-free words on four letters
- Palindromic richness
- Periodicity and the golden ratio
- Periodicity and unbordered segments of words
- Problems in between words and abelian words: \(k\)-abelian avoidability
- Recurrent words with constant abelian complexity
- Repetitions in the Fibonacci infinite word
- Représentation géométrique de suites de complexité 2n+1
- Sequence entropy and the maximal pattern complexity of infinite words
- Sequences with minimal block growth
- Shuffling and unshuffling
- Special factors, periodicity, and an application to Sturmian words
- Strongly non-repetitive sequences and progression-free sets
- Sturmian words and words with a critical exponent
- Sturmian words: structure, combinatorics, and their arithmetics
- Substitutions in dynamics, arithmetics and combinatorics
- Sur un théorème de Thue
- Templates for the \(k\)-binomial complexity of the Tribonacci word
- The abelian complexity of the paperfolding word
- The binomial equivalence classes of finite words
- The characterization of \(N\)-écritures and applications to the study of sequences of finally \(n+c^{st}\) complexity
- The index of Sturmian sequences
- The Logical Approach to Automatic Sequences
- The number of binary words avoiding Abelian fourth powers grows exponentially
- Transcendence of numbers with a low complexity expansion
- Ultimately constant abelian complexity of infinite words
- Uniqueness Theorems for Periodic Functions
- Variations of the Morse-Hedlund theorem for \(k\)-abelian equivalence
- Well-balanced sequences
- Words strongly avoiding fractional powers
Cited in
(14)- Combinatorics on binary words and codimensions of identities in left nilpotent algebras
- On k-Abelian Palindromic Rich and Poor Words
- Minimal Complexities for Infinite Words Written with d Letters
- On a Class of 2-Balanced Sequences
- Automaticity and Parikh-Collinear Morphisms
- Characterizations of families of morphisms and words via binomial complexities
- A small morphism for which the fixed point has an abelian critical exponent less than 2
- 2-balanced sequences coding rectangle exchange transformation
- Automatic abelian complexities of Parikh-collinear fixed points
- Opacity complexity of automatic sequences: the general case
- Words avoiding tangrams
- The reflection complexity of sequences over finite alphabets
- Complexity of infinite words
- Small abelian complexity of multidimensional words
This page was built for publication: Abelian combinatorics on words: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6101322)
