Enumeration of sequences by rises and falls: a refinement of the Simon Newcomb problem
From MaRDI portal
Publication:2554329
DOI10.1215/S0012-7094-72-03932-4zbMath0243.05008MaRDI QIDQ2554329
Publication date: 1972
Published in: Duke Mathematical Journal (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Related Items (20)
Joint distribution of rises, falls, and number of runs in random sequences ⋮ Enumeration of sequences of given specification according ⋮ The combinatorial interpretation of the Jacobi identity from Lie algebras ⋮ Eulerian numbers, Newcomb's problem and representations of symmetric groups ⋮ Enumeration of pairs of permutations and sequences ⋮ The enumeration of sequences with respect to structures on a bipartition ⋮ A combinatorial solution of two related problems in sequence enumeration ⋮ Enumeration of sequences by levels and rises ⋮ Enumeration of pairs of sequences by rises, falls and levels ⋮ The unification of certain enumeration problems for sequences ⋮ The extended Simon Newcomb Problem ⋮ Specialized Möbius inversion ⋮ Multicolored Simon Newcomb problems ⋮ 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 ⋮ Multicolored permutations, sequences, and tableaux ⋮ On the exact distributions of Eulerian and Simon Newcomb numbers associated with random permutations ⋮ Sequence enumeration ⋮ Permutations and sequences
This page was built for publication: Enumeration of sequences by rises and falls: a refinement of the Simon Newcomb problem
