University of Lethbridge

In the past twenty years there has been a flurry of activity in the study of mean values of L-functions. This was precipitated by groundbreaking work of Keating and Snaith in which they modelled these mean values by random matrix theory. In this talk...

The relationship between independence number, chromatic number, clique number, clique cover number and their fractional analogues is well-established for perfect graphs. Here, we study the clique k-cover number cck(G) and the fractional clique k...

The classic theorem of Chebotarev tells us that for any Galois extension L/K of degree n the proportion of primes of K, whose Frobenius conjugacy class is a given conjugacy class of the Galois group is proportional to the size of that conjugacy class...

Quadratic fields have been studied since the time of Gauss, and in modern times have been used in applications such as integer factorization and public-key cryptography. In this talk, we will give a brief overview of some applications and...

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

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

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

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

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

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.