フック長の公式
出典: フリー百科事典『ウィキペディア（Wikipedia）』 (2019/04/18 14:05 UTC 版)
数学の組合せ論において、フック長の公式（フックちょうのこうしき、英語: Hook length formula）とは、与えられたヤング図形の形をした標準盤を数える公式である。表現論や、確率論、アルゴリズム解析などの多種多様な分野に応用があり、最長増加部分列問題などが例としてあげられる。
- ^ Frame, J. S., Robinson, G. de B. and Thrall, R. M. (1954). The hook graphs of the symmetric group. Can. J. Math. 6, 316–325.
- ^ G. Frobenius. Uber die charaktere der symmetrischer gruppe, Preuss. &ad. Wk. sitz. (1900), 516–534.
- ^ A. Young. Quantitative substitutional analysis II, Proc. London Math. Sot., Ser. 1, 35 (1902), 361–397.
- ^ P. A. MacMahon. “Combinatory Analysis,” Cambridge Univ. Press, London/New York, 1916; reprinted by Chelsea, New York, 1960.
- ^ Knuth, Donald (1973). The Art of Computer Programming, Volume 3: Sorting and Searching, 3rd Edition, Addison–Wesley, p. 63
- ^ A. P. Hillman and R. M. Grassl. Reverse plane partitions and tableau hook numbers, J. Comb. Theory, Ser. A 21 (1976), 216–221.
- ^ Greene, C., Nijenhuis, A. and Wilf, H. S. (1979). A probabilistic proof of a formula for the number of Young tableaux of a given shape. Adv. in Math. 31, 104–109.
- ^ J. B. Remmel. Bijective proofs of formulae for the number of standard Young tableaux, Linear and Multilinear Algebra 11 (1982), 45–100.
- ^ Franzblau, D. S. and Zeilberger, D. (1982). A bijective proof of the hook-length formula. J. Algorithms 3, 317–343.
- ^ D. Zeilberger. A short hook-lengths bijection inspired by the Greene–Nijenhuis–Wilf proof, Discrete Math. 51 (1984), 101–108.
- ^ Pak, I. M. and Stoyanovskii, A. V. (1992). A bijective proof of the hook-length formula. Funct. Anal. Appl. 24.
- ^ Novelli, J.-C., Pak, I. M. and Stoyanovskii, A. V. (1997). A direct bijective proof of the hook-length formula. Discrete Mathematics and Theoretical Computer Science 1, 1997, 53–67.
- ^ R. M. Thrall. A combinatorial problem, Michigan Math. J. 1 (1952), 81–88.
- ^ Sagan, B. On selecting a random shifted Young tableau. J. Algorithms 1, 3 (1980), 213–234.
- ^ Sagan, B. E., and Yeh, Y. N. Probabilistic algorithms for trees. Fibonacci Quart. 27, 3 (1989), 201–208.
- ^ Knuth, Donald (1973), The Art of Computer Programming, Volume 3: Sorting and Searching, 3rd Edition, Addison–Wesley, p. 63, ISBN 0-201-03803-X.
- ^ Greene, C., Nijenhuis, A. and Wilf, H. S. (1979). A probabilistic proof of a formula for the number of Young tableaux of a given shape. Adv. in Math. 31, 104–109.
- ^ W. Fulton, J. Harris. Representation Theory: A First Course Springer-Verlag , New York, 1991
- ^ Vershik, A. M.; Kerov, C. V. (1977), "Asymptotics of the Plancheral measure of the symmetric group and a limiting form for Young tableaux", Dokl. Akad. Nauk SSSR 233: 1024–1027
- ^ B. F. Logan and L. A. Shepp, A variational problem for random Young tableaux, Advances in Math. 26 (1977), no. 2, 206–222.
- ^ Knuth, Donald (1973), The Art of Computer Programming, 3 (1 ed.), Addison–Wesley, pp. 61–62
- ^ Stanley, Richard P. (1971), “Theory and applications of plane partitions, 2”, Studies in Applied Mathematics 50: 259–279
- ^ R.P. Stanley, "Ordered Structures and Partitions" PhD Thesis, Harvard University, 1971
- ^ Morales, A. H., Pak, I., and Panova, G. Hook formulas for skew shapes, arXiv:1512.08348.
[続きの解説]
- フック長の公式のページへのリンク
