Paper detail

Hook Weighted Increasing Trees, Cayley Trees and Abel-Hurwitz Identities

Recently Féray, Goulden and Lascoux gave a proof of a new hook summation formula for unordered increasing trees by means of a generalization of the Prüfer code for labelled trees and posed the problem of finding a bijection between weighted increasing trees and Cayley trees. We give such a bijection, providing an answer to the problem posed by Féray, Goulden and Lascoux as well as showing a combinatorial connection to the theory of tree volumes defined by Kelmans. In addition we give two simple proofs of the hook summation formula. As an application we describe how the hook summation formula gives a combinatorial proof of a generalization of Abel and Hurwitz' theorem, originally proven by Strehl.