A reciprocity approach to computing generating functions for permutations with no pattern matches
In this paper, we develop a new method to compute generating functions of the form $NM_τ (t,x,y) = \sum\limits_{n ≥0} {\frac{t^n} {n!}}∑_{σ ∈\mathcal{lNM_{n}(τ )}} x^{LRMin(σ)} y^{1+des(σ )}$ where $τ$ is a permutation that starts with $1, \mathcal{NM_n}(τ )$ is the set of permutations in the symmet...
Main Authors: | Miles Eli Jones, Jeffrey Remmel |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2011-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/2933/pdf |
Similar Items
-
Combinatorial properties of permutation tableaux
by: Alexander Burstein, et al.
Published: (2008-01-01) -
On the Minimum Number of Completely 3-Scrambling Permutations
by: Jun Tarui
Published: (2005-01-01) -
Indecomposable permutations with a given number of cycles
by: Robert Cori, et al.
Published: (2009-01-01) -
Affine permutations and rational slope parking functions
by: Eugene Gorsky, et al.
Published: (2014-01-01) -
Descents of $\lambda$-unimodal cyclic permutations
by: Kassie Archer
Published: (2014-01-01)