Decomposition Based Generating Functions for Sequences

DOI10.4153/CJM-1977-098-3MaRDI QIDQ4113861zbMATH OpenOpenAlexFDO

Authors David M. Jackson, Romas Aleliunas

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

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

Cited in

(16)

• An algebraic theory of sequence enumeration
• The enumeration of sequences with respect to structures on a bipartition
• Algebraic methods for permutations with prescribed patterns
• The distribution of increasing l-sequences in random permutations: A Markov chain approach
• An umbral relation between pattern and commutation in strings
• The distribution of increasing 2-sequences in random permutations of arbitrary multi-sets.
• 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
• Counting permutations by runs
• Counting Successions in Permutations
• A Logarithmic Connection for Circular Permutation Enumeration
• 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
• Counting permutations by alternating descents
• Reciprocals of exponential polynomials and permutation enumeration

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4113861)