English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 109948/140897 (78%)
Visitors : 46128461      Online Users : 714
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 理學院 > 應用數學系 > 學位論文 >  Item 140.119/89754
    Please use this identifier to cite or link to this item: https://nccur.lib.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.html0KbHTML2564View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback