VOLUME 16 2011 NUMBER 1

On Square-Free Permutations
Sergey Avgustinovich, Sergey Kitaev, Artem Pyatkin, Alexander Valyuzhenich
Pages 3–10





Download Abstract
Fulltext is accessible with your personal account
ShowHide BibTeX
BibTeX:
@article{JALC-2011-003,
  author  = {Sergey Avgustinovich and Sergey Kitaev and Artem Pyatkin and Alexander Valyuzhenich},
  title   = {On Square-Free Permutations},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {16},
  number  = {1},
  pages   = {3--10},
  year    = {2011},
  url     = {https://doi.org/10.25596/jalc-2011-003},
  doi     = {10.25596/jalc-2011-003}
}
If you would like to see an embedded preview, try to select preview as the action for Portable Document Format (PDF) in your brower settings.
Keywords: square freeness, consecutive pattern, enumeration, crucial word, maximal word, permutation
DOI: 10.25596/jalc-2011-003