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.010zbMath1280.05005arXiv1201.0142OpenAlexW2090105520MaRDI QIDQ394208

Miles Eli Jones, Jeffery B. 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 functionsymmetric polynomialleft-to-right minimumpattern match

Mathematics Subject Classification ID

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

Related Items

The combinatorics of Jeff Remmel

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Permutations and words counted by consecutive patterns
• Brick tabloids and the connection matrices between bases of symmetric functions
• Permutation enumeration of the symmetric group and the combinatorics of symmetric functions
• Generating functions for permutations which contain a given descent set
• Descents, inversions, and major indices in permutation groups
• Asymptotic enumeration of permutations avoiding generalized patterns
• Enumeration of \(m\)-tuples of permutations and a new class of power bases for the space of symmetric functions
• Generating functions for statistics on \(C_k\wr S_n\)
• Pattern Matching in the Cycle Structure of Permutations