Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/90185| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | 李陽明 | zh_TW |
| dc.contributor.author | 施耀振 | zh_TW |
| dc.creator | 施耀振 | zh_TW |
| dc.date | 1990 | en_US |
| dc.date | 1989 | en_US |
| dc.date.accessioned | 2016-05-03T06:17:31Z | - |
| dc.date.available | 2016-05-03T06:17:31Z | - |
| dc.date.issued | 2016-05-03T06:17:31Z | - |
| dc.identifier | B2002005450 | en_US |
| dc.identifier.uri | http://nccur.lib.nccu.edu.tw/handle/140.119/90185 | - |
| dc.description | 碩士 | zh_TW |
| dc.description | 國立政治大學 | zh_TW |
| dc.description | 應用數學系 | zh_TW |
| dc.description.abstract | 在此，將介紹一個從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 一致。 | zh_TW |
| dc.description.tableofcontents | 謝詞 . . . . . . . . . . . . . . . . . . . . . i\r\n摘要. . . . . . . . . . . . . . . . . . . . . . ii\r\n目錄. . . . . . . . . . . . . . . . . . . . . .iii\r\n第一章 緒論. . . . . . . . . . . . . . . . . . . . . . 1\r\n§1.1 Introduction. . . . . . . . . . . . . . . . . . . . . . 1\r\n§1.2 Background . . . . . . . . . . . . . . . . . . . . . 3\r\n第二章A Bijective Proof of Complete Binary Trees . . . . . . . . . . . . . . . . . . . . .5\r\n§2.1 N-strings . . . . . . . . . . . . . . . . . . . . . 5\r\n§2.2 The Root of N-stings . . . . . . . . . . . . . . . . . . . . . 10\r\n§2.3 The Bijective Proof . . . . . . . . . . . . . . . . . . . . . 17\r\n附錄. . . . . . . . . . . . . . . . . . . . .27\r\n參考文獻. . . . . . . . . . . . . . . . . . . . . . 29 | zh_TW |
| dc.source.uri | http://thesis.lib.nccu.edu.tw/record/#B2002005450 | en_US |
| dc.title | A Bijective Proof of Complete Binary Trees | zh_TW |
| dc.type | thesis | en_US |
| dc.relation.reference | [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\", 由中央研究院數學研究所 葉永南 先生提供. | zh_TW |
| item.cerifentitytype | Publications | - |
| item.fulltext | With Fulltext | - |
| item.grantfulltext | open | - |
| item.openairecristype | http://purl.org/coar/resource_type/c_46ec | - |
| item.openairetype | 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.