Enumeration of cyclic permutations in $3 \times 1$ grid classes

Kassie Archer, L. -K. Lauderdale

Published 2016-06-14Version 1

A grid class consists of certain permutations whose pictorial depiction can be partitioned into increasing and decreasing parts as determined by a given matrix. In this paper we complete the enumeration of cyclic permutations in the $3 \times 1$ grid classes and give an analog of Wilf-equivalence between these sets.