Pages that link to "Item:Q4113861"

The following pages link to Decomposition Based Generating Functions for Sequences (Q4113861):

Displaying 12 items.

• Counting permutations by runs (Q285069) (← links)
• Counting permutations by alternating descents (Q470946) (← links)
• An algebraic theory of sequence enumeration (Q1146674) (← links)
• The enumeration of sequences with respect to structures on a bipartition (Q1150369) (← links)
• Algebraic methods for permutations with prescribed patterns (Q1166524) (← links)
• The distribution of increasing \(l\)-sequences in random permutations: A Markov chain approach (Q1587702) (← links)
• An umbral relation between pattern and commutation in strings (Q1815313) (← links)
• The distribution of increasing 2-sequences in random permutations of arbitrary multi-sets. (Q1871258) (← links)
• Combinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson (Q2109218) (← links)
• From Hertzsprung's problem to pattern-rewriting systems (Q2109220) (← links)
• Counting Successions in Permutations (Q3208663) (← links)
• A Logarithmic Connection for Circular Permutation Enumeration (Q3322106) (← links)