The enumeration of sequences with respect to structures on a bipartition
From MaRDI portal
Publication:1150369
DOI10.1016/0012-365X(80)90115-6zbMath0456.05008OpenAlexW2007953613MaRDI QIDQ1150369
Barbara Jeffcott, William T. Spears, David M. Jackson
Publication date: 1980
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(80)90115-6
Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Related Items (2)
Cites Work
- Unnamed Item
- Enumeration of arrays by column rises
- Binomial posets, Möbius inversion, and permutation enumeration
- The unification of certain enumeration problems for sequences
- Combinatorial problems of commutation and rearrangements
- Théorie géométrique des polynômes eulériens
- Enumeration of sequences by rises and falls: a refinement of the Simon Newcomb problem
- Enumeration des graphes planaires à l'aide des séries formelles en variables non commutatives
- A Formal Calculus for the Enumerative System of Sequences-I. Combinatorial Theorems
- A Formal Calculus for the Enumerative System of Sequences-II. Applications
- Decomposition Based Generating Functions for Sequences
This page was built for publication: The enumeration of sequences with respect to structures on a bipartition