Enumerating two permutation classes by the number of cycles
We enumerate permutations in the two permutation classes $\text{Av}_n(312, 4321)$ and $\text{Av}_n(321, 4123)$ by the number of cycles each permutation admits. We also refine this enumeration with respect to several statistics.
Main Author: | Kassie Archer |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2022-10-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/6173/pdf |
Similar Items
-
Enumeration of Dumont permutations avoiding certain four-letter patterns
by: Alexander Burstein, et al.
Published: (2021-07-01) -
Enumeration of super-strong Wilf equivalence classes of permutations in the generalized factor order
by: Ioannis Michos, et al.
Published: (2019-11-01) -
The permutation class Av(4213,2143)
by: David Bevan
Published: (2017-04-01) -
A Bijection on Classes Enumerated by the Schröder Numbers
by: Michael W. Schroeder, et al.
Published: (2017-07-01) -
Enumeration of Stack-Sorting Preimages via a Decomposition Lemma
by: Colin Defant
Published: (2021-04-01)