The Dumont ansatz for the Eulerian polynomials, peak polynomials and derivative polynomials
From MaRDI portal
Publication:6065690
DOI10.1007/s00026-022-00609-zarXiv2204.01497MaRDI QIDQ6065690
Publication date: 15 November 2023
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.01497
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Bernoulli and Euler numbers and polynomials (11B68) Permutations, words, matrices (05A05) Grammars and rewriting systems (68Q42) Calculation of integer sequences (11Y55)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The peak statistics on simsun permutations
- Counting permutations by runs
- Context-free grammars for permutations and increasing trees
- Derivative polynomials and enumeration of permutations by number of interior and left peaks
- Context-free grammars, differential operators and formal power series
- Enriched \(P\)-partitions and peak algebras
- Introduction to partially ordered patterns
- On certain combinatorial expansions of the Eulerian polynomials
- Derivative polynomials, Euler polynomials, and associated integer sequences
- William Chen grammars and derivations in trees and arborescences
- Permutations and sequences
- Further triangles of Seidel-Arnold type and continued fractions related to Euler and Springer numbers
- A family of two-variable derivative polynomials for tangent and secant
- Alternating Eulerian polynomials and left peak polynomials
- The Gessel correspondence and the partial \(\gamma \)-positivity of the Eulerian polynomials on multiset Stirling permutations
- A context-free grammar for the \(e\)-positivity of the trivariate second-order Eulerian polynomials
- \(\gamma\)-positivity and partial \(\gamma\)-positivity of descent-type polynomials
- Context-free grammars, generating functions and combinatorial arrays
- Counting signed permutations by their alternating runs
- Théorie géométrique des polynômes eulériens
- Tangent numbers and operators
- Enumeration of snakes and cycle-alternating permutations
- Derivative Polynomials for Tangent and Secant
- Eulerian Numbers
- CONJECTURES INVOLVING ARITHMETICAL SEQUENCES
- Computation of Tangent, Euler, and Bernoulli Numbers
- Enriched 𝑃-Partitions
- Minimax trees and André polynomials