q-hook length formulas for forests

DOI10.1016/0097-3165(89)90028-9zbMath0697.06002OpenAlexW2061219385MaRDI QIDQ911620

Publication date: 1989

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(89)90028-9

zbMATH Keywords

permutations forest linear extensions hook-length labelings structural analysis of posets

Mathematics Subject Classification ID

Partial orders, general (06A06) Trees (05C05) Permutations, words, matrices (05A05) Total orders (06A05)

Related Items

The metric space of limit laws for $q$-hook formulas, A multivariate ``inv hook formula for forests, Sorting index and Mahonian-Stirling pairs for labeled forests, Effective Poset Inequalities, $k$-factorizations of the full cycle and generalized Mahonian statistics on $k$-forests, Counting linear extensions of posets with determinants of hook lengths, Tree hook length formulae, Feynman rules and B-series, Combinatorics of Poincaré’s and Schröder’s equations, Signed mahonians on some trees and parabolic quotients, How often are two permutations comparable?, A noncommutative cycle index and new bases of quasi-symmetric functions and noncommutative symmetric functions, Trees, parking functions and factorizations of full cycles, Permutation statistics and linear extensions of posets, Mahonian pairs, Weighted-inversion statistics and their symmetry groups, The major index polynomial for conjugacy classes of permutations, Trees, functional equations, and combinatorial Hopf algebras, Generalized Dyck tilings, A simple transformation for Mahonian statistics on labelings of rake posets, Mahonian statistics on labeled forests, On $q$-integrals over order polytopes, Connected order ideals and $P$-partitions, Polytopes and Large Counterexamples, The algebra of binary search trees, Linear extensions and comparable pairs in partial orders, Non-ambiguous trees: new results and generalisation, Whitney numbers for poset cones, Naruse hook formula for linear extensions of mobile posets, Counting shellings of complete bipartite graphs and trees, $q$-hook length formulas for signed labeled forests, Naruse hook formula for linear extensions of mobile posets, Tree descent polynomials: unimodality and central limit theorem, Alternation acyclic tournaments, Counting Linear Extensions of Posets with Determinants of Hook Lengths, An analogue of the plactic monoid for binary search trees, Dyck tilings, increasing trees, descents, and inversions, Descent classes of permutations with a given number of fixed points

Cites Work