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

Colbourn, 1996, Two algorithms for unranking arborescences, J. Algorithms, 20, 268, 10.1006/jagm.1996.0014

Frame, 1954, The hook graphs of the symmetric group, Canad. J. Math., 6, 316, 10.4153/CJM-1954-030-1

Garsia, 1981, Method for constructing bijections for classical partition identities, Proc. Nat. Acad. Sci. U.S.A., 78, 2026, 10.1073/pnas.78.4.2026

Hillman, 1976, Reverse plane partitions and tableau hook numbers, J. Combin. Theory Ser. A, 21, 216, 10.1016/0097-3165(76)90065-0

Krattenthaler, 1998, An involution principle-free bijective proof of Stanley's hook-content formula, Discrete Math. Theoret. Comput. Sci., 3, 011

M. Luby, D. Randall, and A. Sinclair, Markov chain algorithms for planar lattice structures (extended abstract), in 36th Annual Symposium on Foundations of Computer Science, 1995, pp. 150–159.

MacMahon, 1916

Novelli, 1997, A direct bijective proof of the hook-length formula, Discrete Math. Theoret. Comput. Sci., 1, 53, 10.46298/dmtcs.239

Pak, 1992, A bijective proof of the hook-length formula and its analogues, Funktsional Anal. i Prilozhen., 26, 80, 10.1007/BF01075638

Propp, 1997, Generating random elements of finite distributive lattices, Electron. J. Combin., 4, 10.37236/1330

Propp, 1996, Exact sampling with coupled Markov chains and applications to statistical mechanics, Random Structures Algorithms, 9, 223, 10.1002/(SICI)1098-2418(199608/09)9:1/2<223::AID-RSA14>3.0.CO;2-O

Propp, 1998, Coupling from the past: A user's guide, 41, 181

Remmel, 1983, A bijective proof of the hook formula for the number of column-strict tableaux with bounded entries, European J. Combin., 4, 45, 10.1016/S0195-6698(83)80008-0

Robbins, 1991, The story of 1, 2, 7, 42, 429, 7436, …, Math. Intelligencer, 13, 12, 10.1007/BF03024081

Sagan, 1991

Schützenberger, 1977, La correspondance de Robinson, 579

Stanley, 1971, Theory and applications of plane partitions, Part 2, Stud. Appl. Math., 50, 259, 10.1002/sapm1971503259

D. B. Wilson, Determinant algorithms for random planar structures, in Proceedings of the Eighth Annual ACM–SIAM Symposium on Discrete Algorithms, 1997, pp. 258–267.

D. B. Wilson, Mixing times of lozenge tiling and card shuffling Markov chains, manuscript in preparation.