University of Lethbridge

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...

It is a classical problem to understand the set of Jacobians of curves among all abelian varieties, i.e., the image of the map Mg→Ag which sends a curve X to its Jacobian JX. In characteristic p, Ag has interesting filtrations, and we can ask how the...

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...

Given a Galois extension of number fields L/K, the Chebotarev Density Theorem asserts that, away from ramified primes, Frobenius automorphisms equidistribute in the set of conjugacy classes of Gal(L/K). In this talk we report on joint work with D...

Given coprime integers $a,b$, the classical identity of Bezout provides integers $u,v$ such that $au-bv = 1$. We consider refinements to this identity, where we ask that $u,v$ are norms from a quadratic extension. We then find ourselves counting...

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...