On (shape-)Wilf-equivalence for words

Ting Guo; Christian Krattenthaler; Yi Zhang

On (shape-)Wilf-equivalence for words

Combinatorics 2018-06-18 v2

Authors: Ting Guo , Christian Krattenthaler , Yi Zhang

Abstract

Stankova and West showed that for any non-negative integer $s$ and any permutation $\gamma$ of $\{4,5,\dots,s+3\}$ there are as many permutations that avoid $231\gamma$ as there are that avoid $312\gamma$ . We extend this result to the setting of words.

Keywords

pattern avoidance in permutations sturmian words and combinatorics on words permutations

Cite

@article{arxiv.1802.09856,
  title  = {On (shape-)Wilf-equivalence for words},
  author = {Ting Guo and Christian Krattenthaler and Yi Zhang},
  journal= {arXiv preprint arXiv:1802.09856},
  year   = {2018}
}

Comments

AmS-LaTeX, 13 pages; minor improvements

Related papers

View all related →