Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"Computational Number Theory"”.
-
Performance Engineering of Modular Symbols
… different subfields of mathematics, including number theory and complex analysis; newform subspaces are spaces spanned by a special type of modular forms and are, in some sense, building blocks of spaces of modular forms. Our program MFSplit is based on modular symbols, which is a formalism …
-
Classifying Polynomials With Reducible Nonreciprocal Parts and the Factorization of Values of Polynomials
… applied Baker's theorem to prove non-trivial, computationally effective upper bounds for [n(n + 1)···(n + k)]<sub>S</sub> for any integer k > 0. Effective upper bounds have also been given by Bennett, Filaseta, and Trifonov for [n(n + 1)]<sub>S</sub> and [n2 + 7]<sub>S</sub>, where S = {2,3} …