Sequence enumeration

DOI10.1007/BF02188008MaRDI QIDQ1837683zbMATH OpenOpenAlexFDO

Authors I. P. Goulden, David M. Jackson

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

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

Cites work

• A Formal Calculus for the Enumerative System of Sequences-II. Applications
• A Formal Calculus for the Enumerative System of Sequences-III. Further Developments
• Algebraic methods for permutations with prescribed patterns
• Binomial posets, Möbius inversion, and permutation enumeration
• Enumeration of sequences by rises and falls: a refinement of the Simon Newcomb problem
• Generating functions for certain types of permutations
• scientific article; zbMATH DE number 3127542 (Why is no real title available?)
• scientific article; zbMATH DE number 3165539 (Why is no real title available?)
• scientific article; zbMATH DE number 3691336 (Why is no real title available?)
• Permutations and successions
• Permutations by Number of Rises and Successions
• The enumeration of sequences with respect to structures on a bipartition

This page was built for publication: Sequence enumeration

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