Abelian combinatorics on words: a survey (Q6101322)

scientific article; zbMATH DE number 7698737

Language	Label	Description	Also known as
English	Abelian combinatorics on words: a survey	scientific article; zbMATH DE number 7698737

Statements

instance of

scholarly article

0 references

title

Abelian combinatorics on words: a survey (English)

0 references

0 references

0 references

Computer Science Review

0 references

publication date

20 June 2023

0 references

full work available at URL

https://arxiv.org/abs/2207.09937

0 references

zbMATH Keywords

combinatorics on words

0 references

abelian combinatorics on words

0 references

discrete mathematics

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

0 references

Substitutions in dynamics, arithmetics and combinatorics

0 references

Automatic Sequences

0 references

Q4714446

0 references

Q3559177

0 references

Formal Languages, Automata and Numeration Systems 1

0 references

Représentation géométrique de suites de complexité $2n+1$

0 references

Episturmian words and some constructions of de Luca and Rauzy

0 references

Sturmian words: structure, combinatorics, and their arithmetics

0 references

Repetitions in the Fibonacci infinite word

0 references

An Introduction to Symbolic Dynamics and Coding

0 references

On Context-Free Languages

0 references

Sequence entropy and the maximal pattern complexity of infinite words

0 references

Sequences with minimal block growth

0 references

Abelian complexity of minimal subshifts

0 references

Balance and abelian complexity of the Tribonacci word

0 references

Abelian complexity function of the Tribonacci word

0 references

Abelian Complexity and Synchronization

0 references

Imbalances in Arnoux-Rauzy sequences

0 references

The abelian complexity of the paperfolding word

0 references

Q5408177

0 references

Q3338346

0 references

Recurrent words with constant abelian complexity

0 references

Q3589628

0 references

Q3332270

0 references

Balances for fixed points of primitive substitutions.

0 references

On the asymptotic abelian complexity of morphic words

0 references

Q5235984

0 references

Computing abelian complexity of binary uniform morphic words

0 references

Maximal pattern complexity of words over $\ell$ letters

0 references

Abelian maximal pattern complexity of words

0 references

Counting abelian squares

0 references

Abelian powers in paper-folding words

0 references

AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY

0 references

Every real number greater than 1 is a critical exponent

0 references

Abelian powers and repetitions in Sturmian words

0 references

Q5089254

0 references

How many squares can a string contain?

0 references

On the number of $k$-powers in a finite word

0 references

Maximum number of distinct and nonequivalent nonstandard squares in a word

0 references

On the average number of regularities in a word

0 references

Abelian-square-rich words

0 references

On nonrepetitive sequences

0 references

Q4584890

0 references

Anti-powers in infinite words

0 references

Abelian antipowers in infinite words

0 references

Avoiding or Limiting Regularities in Words

0 references

Combinatorics, Words and Symbolic Dynamics

0 references

Q3281093

0 references

Strongly non-repetitive sequences and progression-free sets

0 references

Abelian squares are avoidable on 4 letters

0 references

Q5646912

0 references

Q5579506

0 references

A powerful abelian square-free substitution over 4 letters

0 references

ON ABELIAN POWER-FREE MORPHISMS

0 references

On the number of Abelian square-free words on four letters

0 references

Q3024004

0 references

The number of binary words avoiding Abelian fourth powers grows exponentially

0 references

Avoiding Two Consecutive Blocks of Same Size and Same Sum over $\mathbb{Z}^2$

0 references

Q4453444

0 references

Avoidability of long 𝑘-abelian repetitions

0 references

Avoiding abelian powers cyclically

0 references

Sur un théorème de Thue

0 references

A proof of Dejean’s conjecture

0 references

Last cases of Dejean's conjecture

0 references

Words strongly avoiding fractional powers

0 references

On Abelian repetition threshold

0 references

Q3150246

0 references

Avoidable patterns in strings of symbols

0 references

BLOCKING SETS OF TERMS

0 references

Long binary patterns are abelian 2-avoidable

0 references

Every Binary Pattern of Length Greater Than 14 Is Abelian-2-Avoidable

0 references

Avoiding Patterns in the Abelian Sense

0 references

If a DOL language is k-power free then it is circular

0 references

Fixed points avoiding abelian $k$-powers

0 references

Q3396591

0 references

Uniqueness Theorems for Periodic Functions

0 references

An abelian periodicity lemma

0 references

Q4173569

0 references

Periodicity and the golden ratio

0 references

On abelian versions of critical factorization theorem

0 references

Abelian bordered factors and periodicity

0 references

ABELIAN PRIMITIVE WORDS

0 references

ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)

0 references

The Logical Approach to Automatic Sequences

0 references

Abelian borders in binary words

0 references

Dyck Words, Lattice Paths, and Abelian Borders

0 references

Periodicity and unbordered segments of words

0 references

Infinite self-shuffling words

0 references

On highly palindromic words

0 references

On highly palindromic words: the $n$-ary case

0 references

Infinite words with linear subword complexity

0 references

Special factors, periodicity, and an application to Sturmian words

0 references

Sturmian words and words with a critical exponent

0 references

The index of Sturmian sequences

0 references

Least Periods of Factors of Infinite Words

0 references

Abelian periods of factors of Sturmian words

0 references

A characterization of Sturmian words by return words

0 references

Q5404285

0 references

Enumerating Abelian Returns to Prefixes of Sturmian Words

0 references

A note on abelian returns in rotation words

0 references

Everywhere $\alpha $-repetitive sequences and Sturmian words

0 references

A square root map on Sturmian words

0 references

Introducing privileged words: privileged complexity of Sturmian words

0 references

Problems in between words and abelian words: $k$-abelian avoidability

0 references

On some generalizations of abelian power avoidability

0 references

On a generalization of abelian equivalence and complexity of infinite words

0 references

Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence

0 references

A new approach to the 2-regularity of the $\ell$-abelian complexity of 2-automatic sequences

0 references

On cardinalities of $k$-abelian equivalence classes

0 references

k-Abelian Equivalence and Rationality

0 references

Q3994777

0 references

On $k$-abelian palindromes

0 references

FINE AND WILF'S THEOREM FOR k-ABELIAN PERIODS

0 references

On $k$-abelian equivalence and generalized Lagrange spectra

0 references

On certain sequences of lattice points

0 references

Weak abelian periodicity of infinite words

0 references

Another generalization of abelian equivalence: binomial complexity of infinite words

0 references

The binomial equivalence classes of finite words

0 references

Templates for the $k$-binomial complexity of the Tribonacci word

0 references

Binomial complexities and Parikh-collinear morphisms

0 references

Avoiding 2-binomial squares and cubes

0 references

Q4500962

0 references

Avoiding Three Consecutive Blocks of the Same Size and Same Sum

0 references

Avoidability of Additive Cubes over Alphabets of Four Numbers

0 references

Abelian closures of infinite binary words

0 references

On abelian subshifts

0 references

Transcendence of numbers with a low complexity expansion

0 references

The characterization of $N$-écritures and applications to the study of sequences of finally $n+c^{st}$ complexity

0 references

Combinatoire de mots récurrents de complexité<i>n+2</i>

0 references

Covering the positive integers by disjoint sets of the form $\{[n\alpha+\beta]: n=1,2,\dots \}$

0 references

Well-balanced sequences

0 references

Palindromic richness

0 references

Aperiodic two-dimensional words of small abelian complexity

0 references

Identifiers

arXiv ID

2207.09937

0 references

DOI

10.1016/j.cosrev.2022.100532

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6101322