Please use this identifier to cite or link to this item: https://ah.nccu.edu.tw/handle/140.119/89754


Title: A SURVEY ON YOUNG TABLEAUX
Authors: 李朱慧
LI, ZHU-HUI
Contributors: 李陽明
LI, YANG MING
李朱慧
LI, ZHU-HUI
Keywords: 演算法
配對
Date: 1992
1991
Issue Date: 2016-05-02 17:07:09 (UTC+8)
Abstract: Young tableaux是在1900年代由Alfred Young提出。Young lattices的一些特性如ranked,存在最小元素,呈橄欖形,其完全配對的存在均已證出,對於配對問題的證明由於是用代數方法證出,其證明非常複雜因此我們希望能用離散的觀點加以探討。以期能發現簡易的證法。在本論文中將前人的一些結果加以整理,並以程式產生Young lattices觀察其特性。文中共提出二個演算法,一個用來產生Young lattices。另一個為產生Young Lattices配對的演算法。
Reference: Bibliography
[FZ82] D. Franzblau and D. Zeilberger. A bijective proof of the hook-length formular.
Journal Algorithms, 3::317-:342, 1982.
[Knu73] D. E. Knuth. Sorting and Searching, volume :3 of The A rt of Computer
Programming. Addison- Wesley Mass., 1973.
[NW78] A. Nijenhuis and H. Wilf. Combinatorial Algorithms. Academic Press, New
York, second edition, 1978.
[Rut68] D. E. Rutherford. Substitutional Analysis. New York: Hafner, 1968.
[SavS9] C. Savage. Gray code sequences of partitions. Journal Algorithms, 10:,577-
595, 1989.
[Sch61] C. Schensted. Long increasing and decreasing subsequences. Canadian Journal Math ., 13:179-191,1961.
[Sta80] Richard . P. Stanley. Unimodal sequences arising from Lie algebras. Dekker,
New York, 1980.
[Sta81] Richard P. Stanley. Some aspects of groups acting on finite poset. Journal
of Combinatorial theory, pages 132-161, 1981.
[SvV86] Dennis Stanton and Dellnis White. Constuctive Combinatorics. SpriogerVerlag New York Inc., 1986.
Description: 碩士
國立政治大學
應用數學系
Source URI: http://thesis.lib.nccu.edu.tw/record/#B2002004730
Data Type: thesis
Appears in Collections:[應用數學系] 學位論文

Files in This Item:

File SizeFormat
index.html0KbHTML403View/Open


All items in 學術集成 are protected by copyright, with all rights reserved.


社群 sharing