Sequence enumeration

DOI10.1007/BF02188008zbMath0508.05007OpenAlexW3188838250MaRDI QIDQ1837683

David M. Jackson, Ian P. Goulden

Publication date: 1981

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/136887

zbMATH Keywords

Cramer's ruleenumeration problems involving sequences over a finite alphabet

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Determinants, permanents, traces, other special matrix functions (15A15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The enumeration of sequences with respect to structures on a bipartition
• Algebraic methods for permutations with prescribed patterns
• Generating functions for certain types of permutations
• Binomial posets, Möbius inversion, and permutation enumeration
• Permutations and successions
• Enumeration of sequences by rises and falls: a refinement of the Simon Newcomb problem
• A Formal Calculus for the Enumerative System of Sequences-II. Applications
• A Formal Calculus for the Enumerative System of Sequences-III. Further Developments
• Permutations by Number of Rises and Successions

This page was built for publication: Sequence enumeration