MARC보기
LDR02141nmm uu200409 4500
001000000332809
00520240805171628
008181129s2018 |||||||||||||||||c||eng d
020 ▼a 9780438018792
035 ▼a (MiAaPQ)AAI10809531
035 ▼a (MiAaPQ)purdue:22759
040 ▼a MiAaPQ ▼c MiAaPQ ▼d 248032
0820 ▼a 510
1001 ▼a Bond, Jacob A.
24510 ▼a On the Computation and Composition of Belyi? Maps and Dessins D'enfants.
260 ▼a [S.l.] : ▼b Purdue University., ▼c 2018
260 1 ▼a Ann Arbor : ▼b ProQuest Dissertations & Theses, ▼c 2018
300 ▼a 125 p.
500 ▼a Source: Dissertation Abstracts International, Volume: 79-10(E), Section: B.
500 ▼a Adviser: Edray H. Goins.
5021 ▼a Thesis (Ph.D.)--Purdue University, 2018.
520 ▼a This dissertation centers on computing with dessins d'enfants, in the form of constellations, and on the monodromy group of compositions of Belyi? maps.
520 ▼a To begin, a discussion of known effective and efficient algorithms for computing constellations, Belyi? Maps, and dessins d'enfants from one another is presented. Following this is an analysis of how to use double cosets in an optimal way to cou
520 ▼a The method given by Wood for computing the constellation of a composition of Belyi? maps is further developed and extended to allow Belyi? maps which are defined over the complex numbers. By utilizing the fact that the monodromy group of the com
520 ▼a Finally, using the previous results, a cryptographic protocol utilizing compositions of Belyi? maps is proposed. A probabilistic method for efficiently deciding if the monodromy group of a Belyi? map is either the alternating or symmetric group
590 ▼a School code: 0183.
650 4 ▼a Mathematics.
690 ▼a 0405
71020 ▼a Purdue University. ▼b Mathematics.
7730 ▼t Dissertation Abstracts International ▼g 79-10B(E).
773 ▼t Dissertation Abstract International
790 ▼a 0183
791 ▼a Ph.D.
792 ▼a 2018
793 ▼a English
85640 ▼u http://www.riss.kr/pdu/ddodLink.do?id=T14997886 ▼n KERIS
980 ▼a 201812 ▼f 2019
990 ▼a 관리자