Tiered trees, weights, and \(q\)-Eulerian numbers
From MaRDI portal
Publication:1734701
DOI10.1016/j.jcta.2018.12.002zbMath1407.05048arXiv1702.02446OpenAlexW2596546898WikidataQ114162697 ScholiaQ114162697MaRDI QIDQ1734701
Paul E. Gunnells, Einar Steingrímsson, William Dugan, Sam Glennon
Publication date: 27 March 2019
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.02446
Trees (05C05) Extremal problems in graph theory (05C35) Bernoulli and Euler numbers and polynomials (11B68) Permutations, words, matrices (05A05)
Related Items (5)
A maxdrop statistic for standard Young tableaux ⋮ On permutation weights and \(q\)-Eulerian polynomials ⋮ Permutation graphs and the abelian sandpile model, tiered trees and non-ambiguous binary trees ⋮ A bijective enumeration of tiered trees ⋮ Proving identities on weight polynomials of tiered trees via Tutte polynomials
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorics of non-ambiguous trees
- Bijections between affine hyperplane arrangements and valued graphs
- Torus orbits on homogeneous varieties and Kac polynomials of quivers
- Binomial posets, Möbius inversion, and permutation enumeration
- \(q\)-Eulerian polynomials arising from Coxeter groups
- Intransitive trees
- Deformations of Coxeter hyperplane arrangements
- Simply-laced isomonodromy systems
- 𝑞-Eulerian polynomials: Excedance number and major index
- Hyperplane arrangements, interval orders, and trees.
- q-Bernoulli and Eulerian Numbers
This page was built for publication: Tiered trees, weights, and \(q\)-Eulerian numbers