Tiered trees, weights, and q-Eulerian numbers

DOI10.1016/J.JCTA.2018.12.002MaRDI QIDQ1734701zbMATH OpenOpenAlexWikidataFDO

Authors William Dugan, Sam Glennon, Paul E. Gunnells, Einar Steingrímsson

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

zbMATH Keywords

\(q\)-Eulerian numbersEulerian numbersintransitive treesmaxmin treesnonambiguous treespermutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Trees (05C05) Extremal problems in graph theory (05C35) Bernoulli and Euler numbers and polynomials (11B68)

Abstract: Maxmin trees are labeled trees with the property that each vertex is either a local maximum or a local minimum. Such trees were originally introduced by Postnikov, who gave a formula to count them and different combinatorial interpretations for their number. In this paper we generalize this construction and define tiered trees by allowing more than two classes of vertices. Tiered trees arise naturally when counting the absolutely indecomposable representations of certain quivers, and also when one enumerates torus orbits on certain homogeneous varieties. We define a notion of weight for tiered trees and prove bijections between various weight 0 tiered trees and other combinatorial objects; in particular order n weight 0 maxmin trees are naturally in bijection with permutations on n-1 letters. We conclude by using our weight function to define a new q-analogue of the Eulerian numbers.

Recommendations

• Proving identities on weight polynomials of tiered trees via Tutte polynomials
• Postorder trees and Eulerian numbers
• Enumeration of weighted plane trees
• A bijective enumeration of tiered trees
• Enumeration of one class of plane weighted trees
• The generating function of ternary trees and continued fractions
• On the relation between weighted trees and tropical Grassmannians
• X-trees and weighted quartet systems
• Weighted tree-numbers of matroid complexes
• Weighted increasing trees and exponential generating functions

Cites work

• \(q\)-Eulerian polynomials arising from Coxeter groups
• Bijections between affine hyperplane arrangements and valued graphs
• Binomial posets, Möbius inversion, and permutation enumeration
• Combinatorics of non-ambiguous trees
• Deformations of Coxeter hyperplane arrangements
• Eulerian polynomials of spherical type
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 988665 (Why is no real title available?)
• scientific article; zbMATH DE number 4023478 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• Hyperplane arrangements, interval orders, and trees.
• Intransitive trees
• q-Bernoulli and Eulerian Numbers
• Simply-laced isomonodromy systems
• Torus orbits on homogeneous varieties and Kac polynomials of quivers
• 𝑞-Eulerian polynomials: Excedance number and major index

Cited in

(11)

• X-trees and weighted quartet systems
• Proving identities on weight polynomials of tiered trees via Tutte polynomials
• On permutation weights and \(q\)-Eulerian polynomials
• Permutation graphs and the abelian sandpile model, tiered trees and non-ambiguous binary trees
• A maxdrop statistic for standard Young tableaux
• Tiered Trees and Theta Operators
• Associated permutations of complete non-ambiguous trees
• About the determinant of complete non-ambiguous trees
• About the determinant of complete non-ambiguous trees
• A proof of the symmetric theta trees conjecture when q = 0
• A bijective enumeration of tiered trees

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Tiered trees, weights, and \(q\)-Eulerian numbers

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