Avoiding abelian powers cyclically

DOI10.1016/J.AAM.2020.102095MaRDI QIDQ2221763zbMATH OpenOpenAlexFDO

Authors Ville Salo, Markus A. Whiteland

Publication date 2 February 2021

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2006.06307

zbMATH Keywords

abelian powerabelian equivalencecircular wordabelian power avoidancecyclic abelian power avoidance

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Abstract: We study a new notion of cyclic avoidance of abelian powers. A finite word $w$ avoids abelian $N$-powers cyclically if for each abelian $N$-power of period $m$ occurring in the infinite word $w^{o}mega$, we have $mgeq|w|$. Let $mathcalA(k)$ be the least integer $N$ such that for all $n$ there exists a word of length $n$ over a $k$-letter alphabet that avoids abelian $N$-powers cyclically. Let $mathcal{A}_{i}nfty(k)$ be the least integer $N$ such that there exist arbitrarily long words over a $k$-letter alphabet that avoid abelian $N$-powers cyclically. We prove that $5leqmathcalA(2)leq8$, $3leqmathcalA(3)leq4$, $2leqmathcalA(4)leq3$, and $mathcalA(k)=2$ for $kgeq5$. Moreover, we show that $mathcal{A}_{i}nfty(2)=4$, $mathcal{A}_{i}nfty(3)=3$, and $mathcal{A}_{i}nfty(4)=2$.

Recommendations

• On some generalizations of abelian power avoidability
• On Abelian repetition threshold
• AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
• Avoidability of long \(k\)-abelian repetitions
• On \(k\)-abelian avoidability

Cites work

• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (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?)
• A powerful abelian square-free substitution over 4 letters
• A proof of Dejean’s conjecture
• Abelian periods of factors of Sturmian words
• Abelian powers and repetitions in Sturmian words
• Abelian powers in paper-folding words
• Abelian properties of words
• Abelian repetitions in partial words
• Abelian squares are avoidable on 4 letters
• Anagram-free colourings of graphs
• Anagram-free graph colouring
• Another generalization of abelian equivalence: binomial complexity of infinite words
• Automatic Sequences
• Avoiding Abelian squares in partial words
• Characterization of the repetitive commutative semigroups
• Circular critical exponents for Thue-Morse factors
• Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture
• Circularly squarefree words and unbordered conjugates: a new approach
• Last cases of Dejean's conjecture
• ON ABELIAN POWER-FREE MORPHISMS
• On Abelian repetition threshold
• On a generalization of abelian equivalence and complexity of infinite words
• Some unsolved problems
• Strongly non-repetitive sequences and progression-free sets
• The Thue-Morse word contains circular \(5/2^+\) power free words of every length
• The number of binary words avoiding Abelian fourth powers grows exponentially
• There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
• There exist binary circular \(5/2^+\) power free words of every length
• Words strongly avoiding fractional powers

Cited in

(7)

• Avoiding conjugacy classes on the 5-letter alphabet
• Abelian closures of infinite binary words
• On shortest crucial words avoiding abelian powers
• On the 2-binomial complexity of the generalized Thue-Morse words
• Abelian combinatorics on words: a survey
• Attainable lengths for circular binary words avoiding \(k\) powers
• Avoiding 5/4-powers on the alphabet of nonnegative integers

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Avoiding abelian powers cyclically

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2221763)