Tree descent polynomials: unimodality and central limit theorem

DOI10.1007/s00026-019-00484-1zbMath1435.05013arXiv1908.11760OpenAlexW3000017241WikidataQ126350573 ScholiaQ126350573MaRDI QIDQ2307694

Amy Grady, Svetlana Poznanović

Publication date: 25 March 2020

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.11760

zbMATH Keywords

Eulerian polynomialposet whose Hasse diagram is a rooted plane forest

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Unnamed Item
• Chromatic quasisymmetric functions
• q-hook length formulas for forests
• Normal convergence by higher semi-invariants with applications to sums of dependent random variables and random graphs
• On the Neggers-Stanley conjecture and the Eulerian polynomials
• A combinatorial proof of the log-concavity of the numbers of permutations with \(k\) runs
• Counting forests by descents and leaves
• Graphical major indices
• On the maximum degree in a random tree
• A note on the \(\gamma\)-coefficients of the tree Eulerian polynomial