DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Kim, Dong-Su | - |
dc.contributor.advisor | 김동수 | - |
dc.contributor.author | Seo, Seung-Hyun | - |
dc.contributor.author | 서승현 | - |
dc.date.accessioned | 2011-12-14T04:39:46Z | - |
dc.date.available | 2011-12-14T04:39:46Z | - |
dc.date.issued | 2004 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=237503&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/41870 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 수학전공, 2004.2, [ v, 43 p. ] | - |
dc.description.abstract | In this thesis, we give a combinatorial proof for the enumeration of the set ${\mathcal F}_{λ}$ of the minimal transitive factorizations of permutations that have cycle type λ. These factorizations are related to the branched covers of the sphere, which was originally suggested by Hurwitz. In Chapter 2, we introduce some related combinatorial objects - circle chord diagrams, noncrossing partitions, labelled trees, and parking functions. In Chapter 3, we prove that $|{\mathcal F}_{(n)}|=n^{n-2}$, and present an algorithm which generates the elements of ${\mathcal F}_{(n)}$ from parking functions. In Chapter 4, we enumerate some labelled trees combinatorially and count the number of certain parking functions by relating them to labelled trees. In Chapter 5, we give a combinatorial proof of $|{\mathcal F}_{(1,n-1)}|=(n-1)^{n}$ and obtain a refined enumeration of ${\mathcal F}_{(1,n-1)}$ by interpreting them as prime parking functions. In Chapter 6, we construct combinatorial objects whose cardinality is $4(n-1)(n-2)^{n-1}$, and find a bijection from ${\mathcal F}_{(2,n-2)}$ to them. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | COMBINATORICS | - |
dc.subject | BIJECTION | - |
dc.subject | 주차함수 | - |
dc.subject | PERMUTATION | - |
dc.subject | TREE | - |
dc.subject | PARKING FUNCTION | - |
dc.subject | 조합론 | - |
dc.subject | 일대일대응 | - |
dc.subject | 순열 | - |
dc.subject | 수형도 | - |
dc.title | Combinatorics on minimal transitive factorizations of permutations | - |
dc.title.alternative | 순열의 호환분해에 관한 조합론 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 237503/325007 | - |
dc.description.department | 한국과학기술원 : 수학전공, | - |
dc.identifier.uid | 000985174 | - |
dc.contributor.localauthor | Kim, Dong-Su | - |
dc.contributor.localauthor | 김동수 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.