Enumeration of Dumont permutations avoiding certain four-letter patterns
In this paper, we enumerate Dumont permutations of the fourth kind avoiding or containing certain permutations of length 4. We also conjecture a Wilf-equivalence of two 4-letter patterns on Dumont permutations of the first kind.
Main Authors: | Alexander Burstein, Opel Jones |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2021-07-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/6174/pdf |
Similar Items
-
Enumerating two permutation classes by the number of cycles
by: Kassie Archer
Published: (2022-10-01) -
Bounded affine permutations I. Pattern avoidance and enumeration
by: Neal Madras, et al.
Published: (2021-03-01) -
Pattern Avoidance for Random Permutations
by: Harry Crane, et al.
Published: (2018-12-01) -
Enumeration of super-strong Wilf equivalence classes of permutations in the generalized factor order
by: Ioannis Michos, et al.
Published: (2019-11-01) -
Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations
by: Hanna Mularczyk
Published: (2021-08-01)