An edge-weighted hook formula for labelled trees

DOI10.4310/JOC.2014.V5.N2.A6MaRDI QIDQ477977zbMATH OpenFDO

Authors Valentin Féray, I. P. Goulden

Publication date 10 December 2014

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

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

zbMATH Keywords

generating functionhook formulacombinatorial bijectiontree enumeration

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: A number of hook formulas and hook summation formulas have previously appeared, involving various classes of trees. One of these classes of trees is rooted trees with labelled vertices, in which the labels increase along every chain from the root vertex to a leaf. In this paper we give a new hook summation formula for these (unordered increasing) trees, by introducing a new set of indeterminates indexed by pairs of vertices, that we call edge weights. This new result generalizes a previous result by F'eray and Goulden, that arose in the context of representations of the symmetric group via the study of Kerov's character polynomials. Our proof is by means of a combinatorial bijection that is a generalization of the Pr"ufer code for labelled trees.

Recommendations

• A multivariate hook formula for labelled trees
• Bilabelled increasing trees and hook-length formulae
• A unifying approach for proving hook-length formulas for weighted tree families
• The weighted hook length formula
• Hook length formulas for trees by Han's expansion

Cited in

(8)

• scientific article; zbMATH DE number 6806786 (Why is no real title available?)
• A unifying approach for proving hook-length formulas for weighted tree families
• q-hook length formulas for signed labeled forests
• Tree hook length formulae, Feynman rules and B-series
• Sequences of labeled trees related to Gelfand-Tsetlin patterns
• A multivariate hook formula for labelled trees
• Combinatorial families of multilabelled increasing trees and hook-length formulas
• Bilabelled increasing trees and hook-length formulae

This page was built for publication: An edge-weighted hook formula for labelled trees

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