University of Lethbridge

Pro-p groups arise naturally in number theory as quotients of absolute Galois groups over number fields. These groups are quite mysterious. During the 60's, Koch gave a presentation of some of these quotients. Furthermore, around the same period...

The prime number theorem (PNT) gives us the density of primes amongst the natural numbers. We can extend this idea to consider whether we have the asymptotic number of primes predicted by the PNT in a given interval. Currently, this has only been...

TBC

TBC

We will discuss a graph that encodes the divisibility properties of integers by primes. We prove that this graph has a strong local expander property almost everywhere. We then obtain several consequences in number theory, beyond the traditional...

In 1944, Linnik showed that the least prime in an arithmetic progression given by a mod q for (a,q)=1 is at most cq^L for some absolutely computable constants c and L. A lot of work has gone in computing explicit bounds for c and L. The best known...

In 1896, the prime number theorem was established, showing that π(x) ∼ li(x). Perhaps the most widely used estimates in explicit analytic number theory are bounds on |π(x)-li(x)| or the related error term |θ(x)-x|. In this talk we discuss methods one...

In his famous '86 paper, Andrews made several conjectures on the function σ(q) of Ramanujan, including that it has coefficients (which count certain partition-theoretic objects) whose sup grows in absolute value, and that it has infinitely many...

Mathematical transcendence refers to objects (usually numbers or functions) that do not satisfy any polynomial equation, that is, they are not algebraic. The numbers $\pi$ and $e$ are famous transcendental numbers, and $e^x$ and the Gamma function...

I will describe a version of the prime number theorem for arithmetic progressions that is uniform enough to deduce the Siegel-Walfisz theorem, Hoheisel's asymptotic for short intervals, a Brun-Titchmarsh bound and Linnik's bound for the least prime...