Generating functions for descents over words which avoid a consecutive\n pattern

2016/12/14 by Jeffrey B. Remmel, Remmel, Jeffrey, Luvreet Sangha +1
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Combinatorics (math.CO) #FOS: Mathematics #Mathematical Dynamics and Fractals #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1612.04900

openalex publication_date 2016/12/14 · openalex created_date 2022/10/01 · openalex updated_date 2026/07/28

Abstract

In this paper, we extend the reciprocity method introduced by Jones and\nRemmel to study the distributions of descents over words which have noν-matches for words u that have at most one descent.\n

Citations

• Brick tabloids and the connection matrices between bases of symmetric functions

Related

• A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of τ
• Descent distribution on Catalan words avoiding ordered pairs of Relations
• Generating functions for permutations which avoid consecutive patterns with multiple descents
• Equivalence of the Descents Statistic on Some (4,4)-Avoidance Classes of Permutations
• Counting descents, rises, and levels, with prescribed first element, in words