가야대학교 분성도서관
주메뉴
자료검색
- Home
- 상세정보
상세정보
부가기능
Enhanced Algorithms for F-Pure Threshold Computation
상세 프로파일
| 자료유형 | E-Book |
|---|---|
| 개인저자 | Pagi, Gilad. |
| 단체저자명 | University of Michigan. Mathematics. |
| 서명/저자사항 | Enhanced Algorithms for F-Pure Threshold Computation. |
| 발행사항 | [S.l.] : University of Michigan., 2018 |
| 발행사항 | Ann Arbor : ProQuest Dissertations & Theses, 2018 |
| 형태사항 | 130 p. |
| 소장본 주기 | School code: 0127. |
| ISBN | 9780438125995 |
| 일반주기 |
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. |
| 언어 | 영어 |
| 기본자료 저록 | Dissertation Abstracts International79-12B(E). Dissertation Abstract International |
| 대출바로가기 | http://www.riss.kr/pdu/ddodLink.do?id=T15000501 |
소장정보
- 소장정보
인쇄
| No. | 등록번호 | 청구기호 | 소장처 | 도서상태 | 반납예정일 | 예약 | 서비스 | 매체정보 |
|---|---|---|---|---|---|---|---|---|
| 1 | WE00025143 | DP 510 | 가야대학교/전자책서버(컴퓨터서버)/ | 대출불가(별치) |
|
카피라이터
