Skip to content

Refined Restricted Permutations

Aaron Robertson, Dan Saracino, Doron Zeilberger

math.COarXiv:math/0203033

Abstract

Define Snk(α) to be the set of permutations of \1,2,...,n\ with exactly k fixed points which avoid the pattern α∈ Sm. Let snk(α) be the size of Snk(α). We investigate Sn0(α) for all α∈ S3 as well as show that snk(132)=snk(213)=snk(321) and snk(231)=snk(312) for all 0 ≤ k ≤ n.

Create a lesson