# Bijective proofs of the hook formula for rooted trees

@article{Beata2012BijectivePO, title={Bijective proofs of the hook formula for rooted trees}, author={Benyi Beata}, journal={Ars Comb.}, year={2012}, volume={106}, pages={483-494} }

We present a bijective proof of the hook length formula for rooted trees based on the ideas of the bijective proof of the hook length formula for standard tableaux by Novelli, Pak and Stoyanovskii [10]. In section 4 we present another bijection for the formula. MR Subject Classification: 05A05,05A15

#### 2 Citations

Advances in Bijective Combinatorics

- Mathematics
- 2015

of the Ph.D. Thesis Supervisor: Péter Hajnal Associate Professor Doctoral School of Mathematics and Computer Science University of Szeged Bolyai Institute

Hook Inequalities

- Mathematics
- The Mathematical Intelligencer
- 2019

We give an elementary proof of the recent hook inequality given in [MPP3]: $\prod_{u\in \lambda} h(u) \, \le \, \prod_{u\in \lambda} h^\ast(u),$ where $h(u)$ is the usual hook in Young diagram… Expand

#### References

SHOWING 1-10 OF 24 REFERENCES

A direct bijective proof of the hook-length formula

- Computer Science, Mathematics
- Discret. Math. Theor. Comput. Sci.
- 1997

This paper presents a new proof of the hook-length formula, which computes the number of standard Young tableaux of a given shape, and presents two inverse algorithms giving the desired bijection. Expand

Bijective proofs of formulae for the number of standard Yound tableaux

- Mathematics
- 1982

We give a bijective proof of a formula due independently to Frobenius and Young for the number of standard Young tableau of shape λ for λ any partition. Frame, Robinson, and Thrall derived their hook… Expand

Bijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted

- Mathematics, Computer Science
- Electron. J. Comb.
- 1995

The proofs proceed by combining the ordinary, respectively shifted, Hillman–Grassl algorithm and Stanley's $(P,\omega)$-partition theorem with the involution principle of Garsia and Milne. Expand

An Involution Principle-Free Bijective Proof of Stanley's Hook-Content Formula

- Computer Science, Mathematics
- Discret. Math. Theor. Comput. Sci.
- 1998

A bijective proof for Stanley's hook-content formula for the generating function for column-strict reverse plane partitions of a given shape is given that does not involve the involution principle of… Expand

A Bijective Proof of the Hook-Length Formula

- Mathematics, Computer Science
- J. Algorithms
- 1982

A new combinatorial proof of the well-known theorem that if λ is a partition of n, then the number of Standard Young Tableaux of shapeλ is n! divided by the product of the hook-lengths is given. Expand

A short hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof

- Computer Science, Mathematics
- Discret. Math.
- 1984

This proof was obtained by translating the elegant Greene-Nijenhuis-Wilf proof (Adv. Expand

Another Involution Principle-Free Bijective Proof of Stanley's Hook-Content Formula

- Computer Science, Mathematics
- J. Comb. Theory, Ser. A
- 1999

Another bijective proof of Stanley's hook-content formula for the generating function for semistandard tableaux of a given shape is given that does not involve the involution principle of Garsia and… Expand

Method for constructing bijections for classical partition identities.

- Mathematics, Medicine
- Proceedings of the National Academy of Sciences of the United States of America
- 1981

It appears that the construction of a bijection between the partitions of n with parts congruent to 1 or 4 (mod 5) and the partitions with parts differing by at least 2 and an algorithm for constructing bijections for other identities of Rogers-Ramanujan type such as the Gordon identities is found. Expand

A probabilistic proof of a formula for the number of Young tableaux of a given shape

- Mathematics
- 1979

Publisher Summary This chapter presents a probabilistic proof of a formula for the number of Young tableaux of a given shape. A Young tableau of shape λ is an arrangement of the integers 1, 2,…, n in… Expand

Reverse Plane Partitions and Tableau Hook Numbers

- Computer Science, Mathematics
- J. Comb. Theory, Ser. A
- 1976

Abstract The generating function of R. P. Stanley for reverse plane partitions on a tableau shape is obtained by a direct method that clearly shows the combinatorial significance of the hook numbers… Expand