An edge-weighted hook formula for labelled trees - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Combinatorics Année : 2014

An edge-weighted hook formula for labelled trees

Résumé

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éray 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üfer code for labelled trees.
Fichier principal
Vignette du fichier
JOC99.pdf (337.08 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01128577 , version 1 (10-03-2015)

Identifiants

Citer

Valentin Féray, I. P. Goulden, Alain Lascoux. An edge-weighted hook formula for labelled trees. Journal of Combinatorics, 2014, 5 (2), pp.245-269. ⟨10.4310/JOC.2014.v5.n2.a6⟩. ⟨hal-01128577⟩
189 Consultations
100 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More