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

In 1909, Landau showed that the lim sup of the quotient of n by ϕ(n) log log n is exp(γ), where ϕ(n) is Euler's function. Later, Rosser and Schoenfeld asked whether there were infinitely many n for which n/ϕ(n) is greater than (log log n) exp(γ)...

An "elliptic sequence" is a solution over an arbitrary integral domain of the recursion W(m+n) W(m-n) = W(m+1) W(m-1) W(n)^2 - W(n+1) W(n-1) W(m)^2, where m and n are integers. The theory of integral elliptic sequences was developed by Morgan Ward in...

How many lines may one arrange through the origin in R10 in such a way that any two of them are at least 89° apart? How about in R57? Or Rn as n tends to infinity? Using this simply stated problem as a point of departure, I will explore various areas...

In this talk, we review some classic iterative processes: Mann iterative process, Ishikawa iterative process, Halpern iterative process, Viscosity iterative process, hybrid projection iterative process, for solutions of operator equations involving...