The unification of certain enumeration problems for sequences

DOI10.1016/0097-3165(77)90066-8zbMath0366.05005OpenAlexW2017517258MaRDI QIDQ1241445

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)

Related Items (9)

Joint distribution of rises, falls, and number of runs in random sequences ⋮ 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 ⋮ Immanants, Schur Functions, and the Macmahon Master Theorem ⋮ 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 combinatorics of a class of representation functions

Cites Work

• Unnamed Item
• Unnamed Item
• Combinatorial problems of commutation and rearrangements
• Sequences with adjacent elements unequal
• Enumeration of sequences by rises and falls: a refinement of the Simon Newcomb problem
• Permutations and sequences with repetitions by number of increases
• Enumeration of Compositions by Rises, Falls and Levels
• Inequalities for Matrix Functions of Combinatorial Interest
• Simon Newcomb’s Problem

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