University of Calgary

In 2007, assuming the Riemann Hypothesis (RH), Soundararajan \cite{Moment} proved that the 2k-th moments of the Riemann zeta function on the critical line is bounded by T(log T)^{k^2 + epsilon} for every k positive real number and every epsilon > 0...

In 2009, Büyükboduk published a result in Crelle which expressed the order of the $\chi$-part of the class-group of a number field ($\chi$ a $p$-adic character of a Galois group) in terms of $L$-functions and regulators. The proof used Kolyvagin...

In my thesis, I give a new construction of the tame local Langlands correspondence for GL(n,F), n a prime. The Local Langlands Correspondence for GL(n,F) has been proven recently by Henniart, Harris/Taylor. In the tame case, supercuspidal...

Questions about classical L-functions continue to provide a rich source of research problems today. Of particular interest are global properties of these L-functions, such as moments, growth in the critical strip, and distribution of nontrivial zeros...

I will discuss recent work with Nathaniel Johnston in which we consider a family of operator norms that quantify the degree of entanglement in quantum states. The norms are defined by the Schmidt decomposition theorem for quantum states, and they can...

Diophantine equations, one of the oldest topics of mathematical research, remain the object of intense and fruitful study. A rational solution to a system of algebraic equations is tantamount to a point with rational coordinates (briefly, a "rational...

By a "rational triangle" we mean a plane triangle whose sides are rational numbers. By Heron's formula, there exists such a triangle of area sqrt(a) if and only if a > 0 and x y z (x + y + z) = a for some rationals x, y, z. In a 1749 letter to...

SPAA 2009 is on Algorithms and Computation Theory (SIGACT) and Computer Architecture (SIGARCH). It is sponsored by the ACM Special Interest Groups and organized in cooperation with the European Association for Theoretical Computer Science. SPAA '09...

Principles of Distributed Computing (PODC) is a conference that focuses on research in the theory, design, specification and implementation of distributed systems. PODC is sponsored by ACM, SIGACT, and SIGOPS.