64
Views
15
CrossRef citations to date
0
Altmetric
Original Articles

Bijective proofs of formulae for the number of standard Yound tableaux

Pages 45-100 | Published online: 30 May 2007

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (1)

Jeffrey B. Remmel & Roger Whitney. (1984) A bijective proof of the generating function for the number of reverse plane partitions via lattice paths. Linear and Multilinear Algebra 16:1-4, pages 75-91.
Read now

Articles from other publishers (14)

Alejandro H. Morales, Igor Pak & Greta Panova. (2018) Hook formulas for skew shapes I. q-analogues and bijections. Journal of Combinatorial Theory, Series A 154, pages 350-405.
Crossref
Richard P. StanleyRichard P. Stanley. 2018. Algebraic Combinatorics. Algebraic Combinatorics 103 133 .
Alejandro H. Morales, Igor Pak & Greta Panova. (2017) Hook Formulas for Skew Shapes II. Combinatorial Proofs and Enumerative Applications. SIAM Journal on Discrete Mathematics 31:3, pages 1953-1989.
Crossref
Richard P. StanleyRichard P. Stanley. 2013. Algebraic Combinatorics. Algebraic Combinatorics 103 133 .
Ionuţ Ciocan-Fontanine, Matjaž Konvalinka & Igor Pak. (2012) Quantum cohomology of and the weighted hook walk on Young diagrams . Journal of Algebra 349:1, pages 268-283.
Crossref
Ionuţ Ciocan-Fontanine, Matjaž Konvalinka & Igor Pak. (2011) The weighted hook length formula. Journal of Combinatorial Theory, Series A 118:6, pages 1703-1717.
Crossref
Rong Zhang. (2010) On an identity of Glass and Ng concerning the hook length formula. Discrete Mathematics 310:17-18, pages 2440-2442.
Crossref
Dominique Gouyou-Beauchamps. (1989) Standard Young Tableaux of Height 4 and 5. European Journal of Combinatorics 10:1, pages 69-82.
Crossref
Ö.N Eğecioğlu & J.B Remmel. (1988) A combinatorial proof of the Giambelli identity for Schur functions. Advances in Mathematics 70:1, pages 59-86.
Crossref
Dominique Gouyou-Beauchamps. 1986. Combinatoire énumérative. Combinatoire énumérative 112 125 .
Ira Gessel & Gérard Viennot. (1985) Binomial determinants, paths, and hook length formulae. Advances in Mathematics 58:3, pages 300-321.
Crossref
G. Viennot. 1984. Orders: Description and Roles - In Set Theory, Lattices, Ordered Groups, Topology, Theory of Models and Relations, Combinatorics, Effectiveness, Social Sciences, Proceedings of the Conference on Ordered Sets and their Application Château dc la Tourcttc; Ordres: Description et Rôles - En Théorie des Treillis, des Groupes Ordonnés; en Topologie, Théorie des Modèles et des Relations, Cornbinatoire, Effectivité, Sciences Sociales, Actes de la Conférence sur ies Ensembles Ordonnés et leur Applications Château de la Tourette. Orders: Description and Roles - In Set Theory, Lattices, Ordered Groups, Topology, Theory of Models and Relations, Combinatorics, Effectiveness, Social Sciences, Proceedings of the Conference on Ordered Sets and their Application Château dc la Tourcttc; Ordres: Description et Rôles - En Théorie des Treillis, des Groupes Ordonnés; en Topologie, Théorie des Modèles et des Relations, Cornbinatoire, Effectivité, Sciences Sociales, Actes de la Conférence sur ies Ensembles Ordonnés et leur Applications Château de la Tourette 409 463 .
Jeffrey B. Remmel & Roger Whitney. (1983) A Bijective Proof of the Hook Formula for the Number of Column Strict Tableaux with Bounded Entries. European Journal of Combinatorics 4:1, pages 45-63.
Crossref
Jeffrey B Remmel. (1982) Bijective proofs of some classical partition identities. Journal of Combinatorial Theory, Series A 33:3, pages 273-286.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.