The unification of certain enumeration problems for sequences

DOI10.1016/0097-3165(77)90066-8MaRDI QIDQ1241445zbMATH OpenOpenAlexFDO

Authors David M. Jackson

Publication date 1977

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(77)90066-8

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Cites work

• Combinatorial problems of commutation and rearrangements
• Enumeration of Compositions by Rises, Falls and Levels
• Enumeration of sequences by rises and falls: a refinement of the Simon Newcomb problem
• scientific article; zbMATH DE number 3127542 (Why is no real title available?)
• scientific article; zbMATH DE number 3165539 (Why is no real title available?)
• Inequalities for Matrix Functions of Combinatorial Interest
• Permutations and sequences with repetitions by number of increases
• Sequences with adjacent elements unequal
• Simon Newcomb’s Problem

Cited in

(10)

• The combinatorial interpretation of the Jacobi identity from Lie algebras
• The enumeration of sequences with respect to structures on a bipartition
• A combinatorial solution of two related problems in sequence enumeration
• The combinatorics of a class of representation functions
• 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
• Immanants, Schur Functions, and the Macmahon Master Theorem
• Joint distribution of rises, falls, and number of runs in random sequences
• Families of bosonic suppression laws beyond the permutation symmetry principle

This page was built for publication: The unification of certain enumeration problems for sequences

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