상세정보
Export to Refworks부가기능
Enhanced Algorithms for F-Pure Threshold Computation
상세 프로파일
| 자료유형 | 학위논문 |
|---|---|
| 서명/저자사항 | Enhanced Algorithms for F-Pure Threshold Computation. |
| 개인저자 | Pagi, Gilad. |
| 단체저자명 | University of Michigan. Mathematics. |
| 발행사항 | [S.l.]: University of Michigan., 2018. |
| 발행사항 | Ann Arbor: ProQuest Dissertations & Theses, 2018. |
| 형태사항 | 130 p. |
| 기본자료 저록 | Dissertation Abstracts International 79-12B(E). Dissertation Abstract International |
| ISBN | 9780438125995 |
| 학위논문주기 | Thesis (Ph.D.)--University of Michigan, 2018. |
| 일반주기 |
Source: Dissertation Abstracts International, Volume: 79-12(E), Section: B.
Adviser: Karen E. Smith. |
| 요약 | We explore different computational techniques for the F-pure threshold invariant of monomial ideals and of polynomials. For the former, we introduce a novel algorithm to reduce the number of generators of the ideal and the number of variables in |
| 요약 | For polynomials, we introduce a direct computational technique involving properties of roots of Deuring polynomials, which are closely related to Legendre polynomials. This technique is then applied to two different families of polynomials: poly |
| 요약 | We end the dissertations with generalizing the Deuring polynomial techniques used thus far, and introducing a way to explicitly stratify the coefficient space of polynomials supported by a fixed set of monomials, by identifying regions represent |
| 일반주제명 | Mathematics. |
| 언어 | 영어 |
| 바로가기 | 
: 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
