5 research outputs found
Enumerating two permutation classes by number of cycles
We enumerate permutations in the two permutation classes and by the number of cycles each permutation
admits. We also refine this enumeration with respect to several statistics
Pattern-restricted permutations of small order
We enumerate 132-avoiding permutations of order 3 in terms of the Catalan and
Motzkin generating functions, answering a question of B\'{o}na and Smith from
2019. We also enumerate 231-avoiding permutations that are composed only of
3-cycles, 2-cycles, and fixed points.Comment: 16 page