Palindromic Length in Free Monoids and Free Groups

@inproceedings{Saarela2017PalindromicLI,
  title={Palindromic Length in Free Monoids and Free Groups},
  author={Aleksi Saarela},
  booktitle={WORDS},
  year={2017}
}
Palindromic length of a word is defined as the smallest number n such that the word can be written as a product of n palindromes. It has been conjectured that every aperiodic infinite word has factors of arbitrarily high palindromic length. A stronger variant of this conjecture claims that every aperiodic infinite word has also prefixes of arbitrarily high palindromic length. We prove that these two conjectures are equivalent. More specifically, we prove that if every prefix of a word is a… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Palindromic width of finitely generated solvable groups

  • V. G. Bardakov, K. Gongopadhyay
  • Comm. Algebra 43(11), 4809–4824
  • 2015

On palindromic factorization of words

  • A. E. Frid, S. Puzynina, L. Q. Zamboni
  • Adv. in Appl. Math. 50(5), 737–748
  • 2013

On the palindromic and primitive widths of a free group

  • V. G. Bardakov, V. Shpilrain, V. Tolstykh
  • J. Algebra 285(2), 574–585
  • 2005

Similar Papers

Loading similar papers…