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

In this talk I will consider the discrete moments J_k(T) that are defined by summing the 2k-th power of the absolute value of the derivative of the Riemann zeta function zeta(s) at all nontrivial zeros of zeta(s) whose imaginary part has absolute...

A Hadamard matrix H of order 4n2 is said to be skew-regular if it is of skew-type and the absolute values of the row sums are all 2n. It is conjectured that for each odd integer n there is a skew-regular matrix of order 4n2. A Hadamard matrix H of...

It is known that if the negative Pell equation X2−DY2=−1 is solvable (in integers), and if (x,y) is its solution with smallest positive x and y, then all of its solutions (xn,yn) are given by the formula xn + yn√D = ±(x + y√D) 2n+1 for n∈Z...

Given a field K, a K-valued sequence is said to satisfy a linear recurrence if the n-th term can be expressed as a fixed K-linear combination of the preceding d terms for some d. The sequence of Fibonacci numbers is a famous example of such a...