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

DOI10.1215/S0012-7094-69-03669-2MaRDI QIDQ2536617zbMATH OpenFDO

Authors R. C. Entringer

Publication date 1969

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

Full work available at URL https://doi.org/10.1215/S0012-7094-69-03669-2

zbMATH Keywords

combinatorics

Mathematics Subject Classification ID

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

Cited in

(12)

• 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
• Special values of spectral zeta functions and combinatorics: Sturm-Liouville problems
• Counting permutations by runs
• An asymptotic distribution theory for Eulerian recurrences with applications
• Introduction to partially ordered patterns
• A Logarithmic Connection for Circular Permutation Enumeration
• Dynamic space packing
• Permutations and sequences
• The peak and descent statistics over ballot permutations
• The (, )-Eulerian polynomials and descent-Stirling statistics on permutations

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

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