Equivalence classes of mesh patterns with a dominating pattern
Two mesh patterns are coincident if they are avoided by the same set of permutations, and are Wilf-equivalent if they have the same number of avoiders of each length. We provide sufficient conditions for coincidence of mesh patterns, when only permutations also avoiding a longer classical pattern ar...
Main Authors: | Murray Tannock, Henning Ulfarsson |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2018-02-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/3283/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) -
Descent c-Wilf Equivalence
by: Quang T. Bach, et al.
Published: (2017-03-01) -
Pattern Avoidance in Weak Ascent Sequences
by: Beáta Bényi, et al.
Published: (2024-08-01) -
Enumerating two permutation classes by the number of cycles
by: Kassie Archer
Published: (2022-10-01)