| dc.contributor.advisor | 李陽明 | zh_TW |
| dc.contributor.advisor | LI, YANG MING | en_US |
| dc.contributor.author (Authors) | 李朱慧 | zh_TW |
| dc.contributor.author (Authors) | LI, ZHU-HUI | en_US |
| dc.creator (作者) | 李朱慧 | zh_TW |
| dc.creator (作者) | LI, ZHU-HUI | en_US |
| dc.date (日期) | 1992 | en_US |
| dc.date (日期) | 1991 | en_US |
| dc.date.accessioned | 2-May-2016 17:07:09 (UTC+8) | - |
| dc.date.available | 2-May-2016 17:07:09 (UTC+8) | - |
| dc.date.issued (上傳時間) | 2-May-2016 17:07:09 (UTC+8) | - |
| dc.identifier (Other Identifiers) | B2002004730 | en_US |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/89754 | - |
| dc.description (描述) | 碩士 | zh_TW |
| dc.description (描述) | 國立政治大學 | zh_TW |
| dc.description (描述) | 應用數學系 | zh_TW |
| dc.description.abstract (摘要) | Young tableaux是在1900年代由Alfred Young提出。Young lattices的一些特性如ranked，存在最小元素，呈橄欖形，其完全配對的存在均已證出，對於配對問題的證明由於是用代數方法證出，其證明非常複雜因此我們希望能用離散的觀點加以探討。以期能發現簡易的證法。在本論文中將前人的一些結果加以整理，並以程式產生Young lattices觀察其特性。文中共提出二個演算法，一個用來產生Young lattices。另一個為產生Young Lattices配對的演算法。 | zh_TW |
| dc.description.tableofcontents | Abstract ii 1 Introduction 1 2 Previous Works 3 2.1 Permutations and Pairs of Tableaux．．．．．．．．．．４ 2.2 Generating Young Tableaux ．．．．．．．．．．10 2.3 Counting Tableaux by Shape ．．．．．．．．．．13 3 Matching Algorithms 14 3.1 Notations and Basic Definitions．．．．．．．．．．14 3.2 Operations．．．．．．．．．．17 3.3 Algorithms．．．．．．．．．．21 3.3.1 Generate Young Lattices．．．．．．．．．．21 3.3.2 How to Match．．．．．．．．．．23 4 Conclusion 27 A Generate Young lattice of (Y4 X 41,R) 28 B Matching Result 31 Bibliography 33 | zh_TW |
| dc.source.uri (資料來源) | http://thesis.lib.nccu.edu.tw/record/#B2002004730 | en_US |
| dc.subject (關鍵詞) | 演算法 | zh_TW |
| dc.subject (關鍵詞) | 配對 | zh_TW |
| dc.title (題名) | A SURVEY ON YOUNG TABLEAUX | zh_TW |
| dc.type (資料類型) | thesis | en_US |
| dc.relation.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. | zh_TW |
