University of Lethbridge

Please bring your favourite (math) problems. Anyone with a problem to share will be given about 5 minutes to present it. We will also choose most of the speakers for the rest of the semester.

Following the framework of Rubinstein and Sarnak for Chebyshev's bias, one obtains a limiting logarithmic distribution μ. Then assuming that the zeros of the L-functions are linearly independent over Q, one can show that the distribution μ is smooth...

Previously, in this seminar series, we have heard about explicit bounds on the sum of values of the von Mangoldt function Lambda(n) (for n x). The point of lift-off for bounding this sum is the explicit formula, which pulls the zeros of the Riemann...

For every generating set S of any finite group G, there is a corresponding Cayley graph Cay(G;S). It was conjectured in the early 1970's that Cay(G;S) always has a hamiltonian cycle, but there has been very little progress on this problem. Joint work...

Suppose G is a finite group of order 6pq such that p and q are distinct prime numbers. It is conjectured that, if S is any generating set of G, then there is a Hamiltonian cycle in Cay(G;S). The talk will discuss a special case of this problem which...

Dirichlet's theorem on arithmetic progressions states that for any (a,q)=1, there are infinitely many primes congruent to a modulo q. Such a theorem together with Euler's earlier work on the infinitude of primes represents the beginning of the study...

The study of the asymptotic behaviour of the summatory function of the number of divisors of shifted primes was initiated by Titchmarsh, who used the generalised Riemann hypothesis to establish a main term and remainder for the sum of tau(p-a) for p...

Well, it's not really a construction yet -- it's more like a template for constructions. It's a way to take many copies of one tetravalent graph B, the 'base graph', and identify each edge-midpoint with one other according to another graph C, the...

In this talk we will begin by discussing the main goals of number theory and by explaining why zeta and L-functions are important. We will then introduce the Mahler measure, which is a function on the roots of polynomials but can also be extended to...

For any finite group G, a natural question to ask is the order of the smallest possible automorphism group for a Cayley graph on G. A particular Cayley graph whose automorphism group has this order is referred to as an MRR (Most Rigid Representation)...