Enumeration of permutations of \((1, \ldots, n)\) by number of maxima

DOI10.1215/S0012-7094-69-03669-2zbMath0186.01502MaRDI QIDQ2536617

Roger Entringer

Publication date: 1969

Published in: Duke Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

combinatorics

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (9)

Counting permutations by runs ⋮ Introduction to partially ordered patterns ⋮ A Logarithmic Connection for Circular Permutation Enumeration ⋮ An asymptotic distribution theory for Eulerian recurrences with applications ⋮ 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 peak and descent statistics over ballot permutations ⋮ Permutations and sequences

This page was built for publication: Enumeration of permutations of \((1, \ldots, n)\) by number of maxima