Decomposition Based Generating Functions for Sequences

DOI10.4153/CJM-1977-098-3zbMath0345.05117OpenAlexW2327446620MaRDI QIDQ4113861

Romas Aleliunas, David M. Jackson

Publication date: 1977

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1977-098-3

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Related Items (16)

Counting permutations by runs ⋮ Counting Successions in Permutations ⋮ An algebraic theory of sequence enumeration ⋮ The enumeration of sequences with respect to structures on a bipartition ⋮ Algebraic methods for permutations with prescribed patterns ⋮ Counting permutations by alternating descents ⋮ A Logarithmic Connection for Circular Permutation Enumeration ⋮ An umbral relation between pattern and commutation in strings ⋮ A Formal Calculus for the Enumerative System of Sequences-I. Combinatorial Theorems ⋮ A Formal Calculus for the Enumerative System of Sequences-II. Applications ⋮ A Formal Calculus for the Enumerative System of Sequences-III. Further Developments ⋮ The distribution of increasing \(l\)-sequences in random permutations: A Markov chain approach ⋮ Combinatorial and algebraic enumeration: a survey of the work of Ian P. Goulden and David M. Jackson ⋮ From Hertzsprung's problem to pattern-rewriting systems ⋮ Reciprocals of exponential polynomials and permutation enumeration ⋮ The distribution of increasing 2-sequences in random permutations of arbitrary multi-sets.

This page was built for publication: Decomposition Based Generating Functions for Sequences