Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Publication
- Publication Type
Articles 1 - 6 of 6
Full-Text Articles in Number Theory
Boolean Group Structure In Class Groups Of Positive Definite Quadratic Forms Of Primitive Discriminant, Christopher Albert Hudert Jr.
Boolean Group Structure In Class Groups Of Positive Definite Quadratic Forms Of Primitive Discriminant, Christopher Albert Hudert Jr.
Student Research Submissions
It is possible to completely describe the representation of any integer by binary quadratic forms of a given discriminant when the discriminant’s class group is a Boolean group (also known as an elementary abelian 2-group). For other discriminants, we can partially describe the representation using the structure of the class group. The goal of the present project is to find whether any class group with 32 elements and a primitive positive definite discriminant is a Boolean group. We find that no such class group is Boolean.
On L-Functions And The 1-Level Density, Arav Agarwal
On L-Functions And The 1-Level Density, Arav Agarwal
Honors Projects
We begin with the classical study of the Riemann zeta function and Dirichlet L-functions. This includes a full exposition on one of the most useful ways of exploiting their connection with primes, namely, explicit formulae. We then proceed to introduce statistics of low-lying zeros of Dirichlet L-functions, discussing prior results of Fiorilli and Miller (2015) on the 1-level density of Dirichlet L-functions and their achievement in surpassing the prediction of the powerful Ratios Conjecture. Finally, we present our original work partially generalizing these results to the case of Hecke L-functions over imaginary quadratic fields.
The Hfd Property In Orders Of A Number Field, Grant Moles
The Hfd Property In Orders Of A Number Field, Grant Moles
All Theses
We will examine orders R in a number field K. In particular, we will look at how the generalized class number of R relates to the class number of its integral closure R. We will then apply this to the case when K is a quadratic field to produce a more specific relation. After this, we will focus on orders R which are half-factorial domains (HFDs), in which the irreducible factorization of any element α∈R has fixed length. We will determine two cases in which R is an HFD if and only if its ring of …
Algorithmic Factorization Of Polynomials Over Number Fields, Christian Schulz
Algorithmic Factorization Of Polynomials Over Number Fields, Christian Schulz
Mathematical Sciences Technical Reports (MSTR)
The problem of exact polynomial factorization, in other words expressing a polynomial as a product of irreducible polynomials over some field, has applications in algebraic number theory. Although some algorithms for factorization over algebraic number fields are known, few are taught such general algorithms, as their use is mainly as part of the code of various computer algebra systems. This thesis provides a summary of one such algorithm, which the author has also fully implemented at https://github.com/Whirligig231/number-field-factorization, along with an analysis of the runtime of this algorithm. Let k be the product of the degrees of the adjoined elements used …
The Kronecker-Weber Theorem: An Exposition, Amber Verser
The Kronecker-Weber Theorem: An Exposition, Amber Verser
Lawrence University Honors Projects
This paper is an investigation of the mathematics necessary to understand the Kronecker-Weber Theorem. Following an article by Greenberg, published in The American Mathematical Monthly in 1974, the presented proof does not use class field theory, as the most traditional treatments of the theorem do, but rather returns to more basic mathematics, like the original proofs of the theorem. This paper seeks to present the necessary mathematical background to understand the proof for a reader with a solid undergraduate background in abstract algebra. Its goal is to make what is usually an advanced topic in the study of algebraic number …
The Proof Of Fermat's Last Theorem, Mohamad Trad
The Proof Of Fermat's Last Theorem, Mohamad Trad
Theses Digitization Project
Fermat, Pierre de, is perhaps the most famous number theorist who ever lived. Fermat's Last Theorem states that the equation xn + yn = zn has no non-zero integer solutions for x, y and z when n>2.