Ting Guo, Christian Krattenthaler, Yi Zhang
Published 2018-02-27Version 1
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.
Comments: AmS-LaTeX, 13 pages
A bijection to count (1-23-4)-avoiding permutations
Equidistribution of (X,Y)-descents, (X,Y)-adjacent pairs, and (X,Y)-place-value pairs on permutations
The number of bar{3}bar{1}542-avoiding permutations
![QR code for arXiv:1802.09856 [math.CO]](http://oss.arxitics.com/images/favicon.svg)