Polynomials. Finite fields (Algebra). Algebraic functions. Number theory.
The ring of univariate polynomials over a finite field shares many foundational arithmetic properties with the ring of rational integers. This similarity makes it possible for many problems in elementary number theory to be translated 'through the...
In this thesis we look at several problems that lie in the intersection between combinatorial and multiplicative number theory. A common theme of many of these problems are estimates for and properties of the smooth numbers, those integers not...
Siegel domains. Modular groups. Hecke algebras. Forms
In the 1960s Satake proved the existence of an isomorphism between the local Hecke algebra and the ring of polynomials invariant under the action of the signed permutation group W n (the Weyl group associated to Sp n over a local field)....
A polynomial is a product of distinct cyclotomic polynomials if and only if it is a divisor over [Special characters omitted.] [x ] of xn - 1 for some positive integer n. In this thesis, we will examine two natural questions concerning the divisors...
In this thesis, we consider several problems relating to cyclic subgroups of the group [mathematical equation]. Each element of [mathematical equation] has a unique representative in one of the two intervals [mathematical equation] and...
The Euler '-function and Carmichael -function are extremely important in modern number theory, and much work has been devoted to studying the distribution and arithmetic properties of the values of each function. One interesting unresolved question...
Motivated by quantum mechanics and geometric optics, it is a long-standing problem whether the length spectrum of a compact Riemannian manifold can be recovered from its Laplace spectrum. One route to proving that the length spectrum depends on the...
The advent of hypervisors revolutionized the computing industry in terms of malware prevention and detection, secure virtual machine managers, and cloud resilience. However, this has resulted in a disjointed response to handling known threats...
'Orthogonal modular forms are algebraic modular forms arising from lattices in quadratic spaces. In this thesis, we define orthogonal modular forms, establish their basic properties, and then apply them to a case of ternary quadratic spaces to...
In a variety of applications spanning mobile devices, performance computing, and even renewable energy and automotive, power management and power delivery are an increasing bottleneck in reducing size and cost, improving reliability, and even...
Partially ordered sets and permutations are combinatorial structures having vast applications in theoretical computer science. In this thesis, we study various computational and algorithmic problems related to these structures. The first chapter of...
The Border Gateway Protocol (BGP) that manages inter-domain routing on the Internet lacks security. Protective measures using public key cryptography introduce complexities and costs. To support authentication and other security functionality in...
Let K be the function field over a finite field of odd order, and let H be a definite quaternion algebra over K. If Î‘ is an order of level M in H , we define theta series for each ideal I of Î‘ using the reduced norm on H. Using harmonic analysis...
The study of twin primes gives rise to several famously difficult problems in number theory--in fact, we still cannot definitively say whether there are infinitely many twin primes. In this work, we consider a related problem, namely: What is the...
Proteins, the basic structural and functional building blocks of cellular machinery, evolve under significant constraint. Evolutionary pressures limit the acceptable variation and covariation of amino acids in a protein. As such, these evolutionary...
The theory community has worked on Secure Multiparty Computation (SMC) for more than two decades, and has produced many protocols for many settings. One common thread in these works is that the protocols cannot use a Trusted Third Party (TTP), even...
Sorting very large datasets is a key subroutine in almost any application that is built on top of a large database. Two ways to sort out-of-core data dominate the literature: merging-based algorithms and partitioning-based algorithms. Within these...
This thesis investigates the embedding theory of orders in central simple algebras, placing a particular emphasis on the role that the phenomenon known as selectivity plays in the theory. Although the notion of selectivity is completely algebraic,...