DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | 임보해 | - |
dc.contributor.author | Kim, Beomho | - |
dc.contributor.author | 김범호 | - |
dc.date.accessioned | 2024-07-30T19:31:10Z | - |
dc.date.available | 2024-07-30T19:31:10Z | - |
dc.date.issued | 2024 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=1096728&flag=dissertation | en_US |
dc.identifier.uri | http://hdl.handle.net/10203/321510 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 수리과학과, 2024.2,[ii, 36 p. :] | - |
dc.description.abstract | We implement the splitting algorithm based on brute force to construct a special polygon for $\Gamma_0(N)$ in the sense of Kulkarni and apply it to find an optimal value $m(\Gamma_0(N))$ denotes the minimum of the maximum value of the denominators among all possible special polygons. In the special case of $N=33$, we further determine whether the set of its special polygons contains a generalized Farey sequence with denominators less than or equal to $\lfloor \sqrt{N}\rfloor$ or not. Finally, we list up all types of special polygons for $\Gamma_0(N)$ when $N\leq 50$ is of the form $p$, $p^2$, or $pq$ for close odd primes $p$ and $q$. | - |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | 모듈러 군▼a합동 부분군▼a독립 생성 시스템▼a특수 다각형▼a페리 수열▼a브루트 포스 알고리즘 | - |
dc.subject | Modular group▼aCongruence subgroup▼aIndependent generating system▼aSpecial polygon▼aFarey sequence▼aBrute force algorithm | - |
dc.title | (A) numerical method to find an optimal independent system for certain congruence subgroups | - |
dc.title.alternative | 특정 합동 부분군에 대한 최적의 독립 시스템을 찾는 수치적 방법 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 325007 | - |
dc.description.department | 한국과학기술원 :수리과학과, | - |
dc.contributor.alternativeauthor | Im, Bo-Hae | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.