Please use this identifier to cite or link to this item: https://ah.lib.nccu.edu.tw/handle/140.119/89754
題名: A SURVEY ON YOUNG TABLEAUX
作者: 李朱慧
LI, ZHU-HUI
貢獻者: 李陽明
LI, YANG MING
李朱慧
LI, ZHU-HUI
關鍵詞: 演算法
配對
日期: 1992
上傳時間: 2-May-2016
摘要: Young tableaux是在1900年代由Alfred Young提出。Young lattices的一些特性如ranked,存在最小元素,呈橄欖形,其完全配對的存在均已證出,對於配對問題的證明由於是用代數方法證出,其證明非常複雜因此我們希望能用離散的觀點加以探討。以期能發現簡易的證法。在本論文中將前人的一些結果加以整理,並以程式產生Young lattices觀察其特性。文中共提出二個演算法,一個用來產生Young lattices。另一個為產生Young Lattices配對的演算法。
參考文獻: Bibliography\r\n[FZ82] D. Franzblau and D. Zeilberger. A bijective proof of the hook-length formular.\r\nJournal Algorithms, 3::317-:342, 1982.\r\n[Knu73] D. E. Knuth. Sorting and Searching, volume :3 of The A rt of Computer\r\nProgramming. Addison- Wesley Mass., 1973.\r\n[NW78] A. Nijenhuis and H. Wilf. Combinatorial Algorithms. Academic Press, New\r\nYork, second edition, 1978.\r\n[Rut68] D. E. Rutherford. Substitutional Analysis. New York: Hafner, 1968.\r\n[SavS9] C. Savage. Gray code sequences of partitions. Journal Algorithms, 10:,577-\r\n595, 1989.\r\n[Sch61] C. Schensted. Long increasing and decreasing subsequences. Canadian Journal Math ., 13:179-191,1961.\r\n[Sta80] Richard . P. Stanley. Unimodal sequences arising from Lie algebras. Dekker,\r\nNew York, 1980.\r\n[Sta81] Richard P. Stanley. Some aspects of groups acting on finite poset. Journal\r\nof Combinatorial theory, pages 132-161, 1981.\r\n[SvV86] Dennis Stanton and Dellnis White. Constuctive Combinatorics. SpriogerVerlag New York Inc., 1986.
描述: 碩士
國立政治大學
應用數學系
資料來源: http://thesis.lib.nccu.edu.tw/record/#B2002004730
資料類型: thesis
Appears in Collections:學位論文

Files in This Item:
File SizeFormat
index.html115 BHTML2View/Open
Show full item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.