Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/90185
題名: | A Bijective Proof of Complete Binary Trees | 作者: | 施耀振 | 貢獻者: | 李陽明 施耀振 |
日期: | 1990 | 上傳時間: | 3-五月-2016 | 摘要: | 在此,將介紹一個從Tnc 映至Sn的bijection, 其中Tnc = {tc: tc 是一有2n-1 個點的complete binary tree ,其中有一點被圈選} & Sn={x: x是一有n個黑點,n-1個白點的string }。並藉此求得k1*k 2*... *kn在” *”不可結合( nonassociative )之下的二元運算( binary operation )方法數。這個解與Catalan number 一致。 | 參考文獻: | [1] J. A. Bondy & U. S. R. Murty, Graph Theory With Application. London. Macmillan, 1976.\r\n[2] Gary Chartrant & Linda Lesniak. Graphs & Digraphs. 2nd ed ., Wadsworth Inc., Belmont. 1986.\r\n[3] Marshall Hall. JR., Combinatorial Theory, 2nd ed., New York, Wiley. 1986.\r\n[4] Richard Johnsonbaugh, Discrete Mathematics, New York,Macmillan; London. Collier Macmillan. 1984.\r\n[5] I. Niven. Formal Power Series, Amer. Math. Monthly 76 (1969), pp.871-889.\r\n[6] Dennis Staton & Dennis White, Constructive Combinatorics. New York. Springer-Verlag, 1986, p.60.\r\n[7] Alan Tucker. Applied Combinatorics, New York, Wiley, 1980.\r\n[8] \"Introduction to the Theory of Combinatorial Species\", 由中央研究院數學研究所 葉永南 先生提供. | 描述: | 碩士 國立政治大學 應用數學系 |
資料來源: | http://thesis.lib.nccu.edu.tw/record/#B2002005450 | 資料類型: | thesis |
Appears in Collections: | 學位論文 |
Files in This Item:
File | Size | Format | |
---|---|---|---|
index.html | 115 B | HTML2 | View/Open |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.