University of Lethbridge

A natural way to understand groups visually is by examining objects on which the group has a natural permutation action. In fact, this is often the way we first show groups to undergraduate students: introducing the cyclic and dihedral groups as the...

Bertrand's postulate states that there is always a prime in the interval [x,2x] for any x≥1. Applying the prime number theorem, one may further show that there is approximately ∫2xxdtlogt primes in [x,2x] for sufficiently large x. There is a more...

In this talk, I will talk about the fourth moment of quadratic Dirichlet L-functions. Under the generalized Riemann hypothesis, we showed an asymptotic formula for the fourth moment. Unconditionally, we established a precise lower bound.

Deep learning lies at the forefront of the artificial intelligence revolution. Stunning successes has been achieved by deep learning for challenging tasks such as image classification. Yet, current deep learning implementations have a tendency to be...

Let q≡1(mod4) be a prime power and Fq be the finite field with q elements. Let 1/2σ1 be fixed. We consider D a monic square-free polynomial in Fq[T] and χD the Kronecker symbol associated with D. In this talk, we will discuss the distribution of...

Let omega(n) denote the number of distinct prime divisors of n. Let W(m) be a random integer chosen uniformly from the set of natural numbers less than or equal to m. Let X(m) be omega(W(m)). The celebrated Erdos-Kac theorem asserts that if the...

In this talk we will discuss a combinatorial approach to studying the geometry of the moduli space of Langlands parameters for GLn. We will first discuss several connections between the study of partitions and the study of nilpotent conjugacy classes...

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.

The first half of this talk will be a gentle introduction to the Erdős–Ko–Rado theorem (EKR) Theorem. This is a theorem that determines the size and structure of the largest collection of intersecting sets. It has become a cornerstone of extremal set...

The 2k-th moments I_k(T) of the Riemann zeta function have been studied extensively. In the late 90's, Keating-Snaith gave a conjecture for the size of I_k(T). At the same time Conrey-Gonek connected I_k(T) to mean values of long Dirichlet...