Corpus ID: 119746209

Solved and unsolved problems about abelian squares

  title={Solved and unsolved problems about abelian squares},
  author={Jamie Simpson},
  journal={arXiv: Combinatorics},
  • J. Simpson
  • Published 2018
  • Mathematics
  • arXiv: Combinatorics
We present and discuss a number of known results and open problems abelian squares in words on small alphabets. 
1 Citations

Tables from this paper

Hardness of Detecting Abelian and Additive Square Factors in Strings
3SUM-hardness (no strongly subquadratic-time algorithm, assuming the 3SUM conjecture) of several problems related to finding Abelian square and additive square factors in a string is proved and conditional optimality of state-of-the-art algorithms for finding such factors is concluded. Expand


Binary Words with Few Squares
A short proof is given for the result of Fraenkel and Simpson stating that there exists an infinite binary word which has only three different squares u^2. Expand
Circular Words Avoiding Patterns
It is proved that there are circular binary cube-free words of every length and several open problems regarding circular words avoiding more general patterns are presented. Expand
Words with the Maximum Number of Abelian Squares
This paper studies infinite words such that the number of abelian square factors of length $n$ grows quadratically with $n$. Expand
On some generalizations of abelian power avoidability
  • M. Rao
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2015
We prove that 2-abelian-cubes are avoidable over a binary alphabet and that 3-abelian-squares are avoidable over a ternary alphabet, answering positively to two questions of Karhumaki et al. We alsoExpand
Strongly Non-Repetitive Sequences and Progression-Free Sets
  • F. Dekking
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. A
  • 1979
Abstract By a simple method we show the existence of (1) a sequence on two symbols in which no four blocks occur consecutively that are permutations of each other, and (2) a sequence on three symbolsExpand
Palindromes in circular words
  • J. Simpson
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2014
This paper shows, with a very complicated proof, that the number of distinct non-empty palindromes with length at most n in a circular word of length n is less than 5n/3. Expand
Maximum number of distinct and nonequivalent nonstandard squares in a word
The combinatorics of nonstandard squares in a word depends on how the equivalence of halves of the square is defined, and several results on the maximum number of distinct squares for nonstandard factor equivalence relations are presented. Expand
Avoiding large squares in infinite binary words
An open question of Prodinger and Urbanek from 1979 is answered by demonstrating the existence of two infinite binary words, each avoiding arbitrarilyLarge squares, such that their perfect shuffle has arbitrarily large squares. Expand
Non-repetitive sequences
This note is concerned with infinite sequences whose terms are chosen from a finite set of symbols. A segment of such a sequence is a set of one or more consecutive terms, and a repetition is a pairExpand
How Many Square Occurrences Must a Binary Sequence Contain?
It is shown that this quantity is a constant fraction of the word length, and it is proved that this constant is 0.55080. Expand