Open Access. Powered by Scholars. Published by Universities.®
- Publication
Articles 1 - 2 of 2
Full-Text Articles in Entire DC Network
Lattice Extensions And Zeros Of Multilinear Polynomials, Maxwell Forst
Lattice Extensions And Zeros Of Multilinear Polynomials, Maxwell Forst
CGU Theses & Dissertations
We treat several problems related to the existence of lattice extensions preserving certain geometric properties and small-height zeros of various multilinear polynomials. An extension of a Euclidean lattice $L_1$ is a lattice $L_2$ of higher rank containing $L_1$ so that the intersection of $L_2$ with the subspace spanned by $L_1$ is equal to $L_1$. Our first result provides a counting estimate on the number of ways a primitive collection of vectors in a lattice can be extended to a basis for this lattice. Next, we discuss the existence of lattice extensions with controlled determinant, successive minima and covering radius. In …
On The Characterization Of Prime Sets Of Polynomials By Congruence Conditions, Arvind Suresh
On The Characterization Of Prime Sets Of Polynomials By Congruence Conditions, Arvind Suresh
CMC Senior Theses
This project is concerned with the set of primes modulo which some monic, irreducible polynomial over the integers has a root, called the Prime Set of the polynomial. We completely characterise these sets for degree 2 polynomials, and develop sufficient machinery from algebraic number theory to show that if the Galois group of a monic, irreducible polynomial over the integers is abelian, then its Prime Set can be written as the union of primes in some congruence classes modulo some integer.