A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern

DOI10.1016/J.DISC.2013.08.010MaRDI QIDQ394208zbMATH OpenOpenAlexFDO

Authors Miles E. Jones, Jeffrey Remmel

Publication date 24 January 2014

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1201.0142

zbMATH Keywords

permutationdescentexponential generating functionleft-to-right minimumpattern matchsymmetric polynomial

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Abstract: In this paper, we introduce a new method for computing generating functions with respect to the number of descents and left-to-right minima over the set of permutations which have no consecutive occurrences of a pattern that starts with 1.

Recommendations

• Applying a reciprocity method to count permutations avoiding two families of consecutive patterns
• Generating functions for descents over permutations which avoid sets of consecutive patterns
• scientific article; zbMATH DE number 6683606
• Permutations and words counted by consecutive patterns
• Generating functions for permutations avoiding a consecutive pattern

Cites work

• scientific article; zbMATH DE number 6683606 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• Asymptotic enumeration of permutations avoiding generalized patterns
• Brick tabloids and the connection matrices between bases of symmetric functions
• Descents, inversions, and major indices in permutation groups
• Enumeration of \(m\)-tuples of permutations and a new class of power bases for the space of symmetric functions
• Generating functions for permutations which contain a given descent set
• Generating functions for statistics on \(C_k\wr S_n\)
• Pattern matching in the cycle structures of permutations
• Permutation enumeration of the symmetric group and the combinatorics of symmetric functions
• Permutations and words counted by consecutive patterns
• Permutations with \(k\)-regular descent patterns

Cited in

(8)

• Applying a reciprocity method to count permutations avoiding two families of consecutive patterns
• Generating functions for descents over permutations which avoid sets of consecutive patterns
• Permutations with \(k\)-regular descent patterns
• Permutations and words counted by consecutive patterns
• Counting permutations with no long monotone subsequence via generating trees and the kernel method
• The combinatorics of Jeff Remmel
• Generating functions for permutations avoiding a consecutive pattern
• scientific article; zbMATH DE number 6683606 (Why is no real title available?)

This page was built for publication: A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394208)