Probabilistic proofs of hook length formulas involving trees

MaRDI QIDQ2654630zbMATH OpenFDO

Authors Bruce E. Sagan

Publication date 20 January 2010

Published in Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0805.0817, https://eudml.org/doc/233227, http://www.emis.de/journals/SLC/wpapers/s61Asagan.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

algorithmhook lengthprobabilitytree

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Trees (05C05) Combinatorial probability (60C05)

Abstract: Recently, Han discovered two formulas involving binary trees which have the interestig property that hooklengths appear as exponents. The purpose of this note is to give a probabilistic proof of one of Han's formulas. Yang has generalized Han's results to ordered trees. We show how the probabilistic approach can also be used in Yang's setting, as well as for a generalization of Han's formula in terms of certain infinite trees.

Recommendations

• On Han's hook length formulas for trees
• A unifying approach for proving hook-length formulas for weighted tree families
• Hook length formulas for trees by Han's expansion
• Bijective proofs of the hook formula for rooted trees.
• A multivariate hook formula for labelled trees

Cited in

(17)

• Discovering hook length formulas by an expansion technique
• Hook length formulas for trees by Han's expansion
• A probabilistic method for the number of standard immaculate tableaux
• A unifying approach for proving hook-length formulas for weighted tree families
• Bijective proofs of the hook formula for rooted trees.
• Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees
• scientific article; zbMATH DE number 4104976 (Why is no real title available?)
• Explicit formulas for a sequence of binary tree polynomials
• scientific article; zbMATH DE number 7203474 (Why is no real title available?)
• Hook Formulas for Skew Shapes II. Combinatorial Proofs and Enumerative Applications
• New hook length formulas for binary trees
• New hook length formulas for binary trees
• On Han's hook length formulas for trees
• Bilabelled increasing trees and hook-length formulae
• Hook length polynomials for plane forests of a certain type
• An insertion algorithm and leaders of rooted trees
• On Postnikov's hook length formula for binary trees

This page was built for publication: Probabilistic proofs of hook length formulas involving trees

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