University of Lethbridge

In this talk, we describe a method for studying the value-distribution of L-functions based on the Jessen-Wintner theory. This method has been explored recently by Ihara and Matsumoto for the case of logarithms and logarithmic derivatives of...

The use of graphs to study permutation groups goes back to Higman who first introduced the orbital graphs, and used them to characterise the primitive groups. Since then, graph theory and permutation group theory have become intertwined, with many...

A permutation group G on X is transitive if for every x and y in X, there exists g in G mapping x to y. The group G is called primitive if, in addition, it preserves no nontrivial partition of X. Let Gamma be a vertex-primitive digraph, that is, its...

A transversal of a latin square of order n is a set of n entries picked in such a way that no row, column or symbol is present more than once. As you add more symbols to a latin square, you expect the number of transversals to increase. We show that...

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. EVERYONE IS WELCOME!

In this talk, we discuss some results on the non-vanishing of the central values of Rankin-Selberg convolutions of families of Hilbert modular forms. Such results are obtained by establishing some asymptotics of certain twisted first and second...

Let f be a primitive modular form and L(s) its associated L-function. Anton Good (1982) bounded |L(s)| by approximately the cube root of the distance from the real axis on the line s = 1/2, in the case f is a modular form on the full modular group...

The prime number theorem, proven in 1896, is one of the first major theorems in analytic number theory. It provides estimates for prime counting functions. In 1962, Rosser and Schoenfeld gave a method to estimate the error term in the approximation...

The Traveling Salesman Problem asks for the shortest route through a collection of cities. This classical problem is very hard, but, by applying Linear Programming (and other techniques), the optimal route has been found in test cases that have tens...

Twin prime powers are used in the construction of some very interesting combinatorial objects. In an old paper they are used in the construction of regular Hadamard matrices. In a recent work, they are used to show the existence of an infinite class...