Descent c-Wilf Equivalence
Let $S_n$ denote the symmetric group. For any $\sigma \in S_n$, we let $\mathrm{des}(\sigma)$ denote the number of descents of $\sigma$, $\mathrm{inv}(\sigma)$ denote the number of inversions of $\sigma$, and $\mathrm{LRmin}(\sigma)$ denote the number of left-to-right minima of $\sigma$. For any seq...
Main Authors: | Quang T. Bach, Jeffrey B. Remmel |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2017-03-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/1312/pdf |
Similar Items
-
Two examples of Wilf-collapse
by: Michael Albert, et al.
Published: (2021-08-01) -
Enumeration of super-strong Wilf equivalence classes of permutations in the generalized factor order
by: Ioannis Michos, et al.
Published: (2019-11-01) -
Uniquely-Wilf classes
by: Michael Albert, et al.
Published: (2019-11-01) -
The 26 Wilf-equivalence classes of length five quasi-consecutive patterns
by: Evan Chen, et al.
Published: (2018-10-01) -
Equivalence classes of mesh patterns with a dominating pattern
by: Murray Tannock, et al.
Published: (2018-02-01)