Refined Restricted Permutations
Aaron Robertson, Dan Saracino, Doron Zeilberger
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
Related papers
An Induced Subgraph Paradigm for Strongly Regular Graph Constructions
Benjamin Baker
Uniform Intersection Numbers and Subgroup-Based Generating Graphs of Groups
Projesh Nath Choudhury, Biswaranjan Khanra
Logical isomorphism and logical limit laws for small permutation classes and regular languages
Klas Marström, Eero Räty
Wild number for spanning trees in complete and complete bipartite graphs
Aleyah Dawkins, Alexander Nappo, Jessie Tong et al.
Unavoidable flats in GF(q)-representable matroids
Jim Geelen, Matthew E. Kroeker, Peter Nelson
Barrier Log-Concavity of Large Forests
Vadim E. Levit