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

2011/12/30 by Miles Eli Jones, Jones, Miles Eli, Jeffrey B. Remmel +1
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Bayesian Methods and Mixture Models #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.1201.0142

arxiv created 2011/12/30 · openalex publication_date 2011/12/30 · arxiv updated 2012/01/04 · openalex created_date 2024/04/10 · openalex updated_date 2026/07/28

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.

Related

• Generating functions for permutations which avoid consecutive patterns with multiple descents
• Generating functions for descents over words which avoid a consecutive\n pattern
• Generating functions for descents over permutations which avoid sets of consecutive patterns
• Permutations containing a pattern exactly once and avoiding at least two patterns of three letters
• restricted 1-3-2 permutations and generalized patterns