A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Refining enumeration schemes to count according to permutation statistics
[article]
2014
arXiv
pre-print
We consider the question of computing the distribution of a permutation statistics over restricted permutations via enumeration schemes. The restricted permutations are those avoiding sets of vincular patterns (which include both classical and consecutive patterns), and the statistics are described in the number of copies of certain vincular patterns such as the descent statistic and major index. An enumeration scheme is a polynomial-time algorithm (specifically, a system of recurrence
arXiv:1401.0337v1
fatcat:pvkra3bemfdvblyeiuc4ys7qqu