Affordable Access

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

Authors
  • Carrell, S. R.
Type
Preprint
Publication Date
Aug 12, 2014
Submission Date
Aug 12, 2014
Identifiers
arXiv ID: 1408.2786
Source
arXiv
License
Yellow
External links

Abstract

Recently F\'eray, Goulden and Lascoux gave a proof of a new hook summation formula for unordered increasing trees by means of a generalization of the Pr\"ufer 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\'eray, 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.

Report this publication

Statistics

Seen <100 times