University of Calgary

We will talk about Drinfeld modules, and how they compare to elliptic curves for algorithms and computations. Drinfeld modules can be seen as function field analogues of elliptic curves. They were introduced in the 1970's by Vladimir Drinfeld, to...

We will explore how a Fourier optimization framework may be used to study two classical problems in number theory involving Dirichlet characters: The problem of estimating the least character non-residue; and the problem of estimating the least prime...

Twenty-first century mathematics has seen the rise of the proof assistant, and mathematical practice has changed significantly with the rise of these new tools. One consequence of this change, for the philosopher of mathematics, is the wider adoption...

Introduction to knowledge graph with an application in Construction Code Compliance with BIM and Linked Building Data Abstract: Knowledge graph and ontology are powerful mathematical constructs that has a lot of applications. This presentation begins...

We show that the reduction of a projective endomorphism modulo a discrete valuation naturally takes the form of a set-theoretic correspondence. This raises the possibility of classifying "reduction types" of such dynamical systems, reminiscent of the...

In 1966, Tate proposed the Artin–Tate conjectures, which expresses special values of zeta function associated to surfaces over finite fields. Conditional on the Tate conjecture, Milne–Ramachandran formulated and proved similar conjectures for smooth...

The Polya group P o ( K ) of a Galois number field K coincides with the subgroup of the ideal class group C l ( K ) of K consisting of all strongly ambiguous ideal classes. We prove that there are only finitely many imaginary abelian number fields K...

Plenary Talk Abstracts De-clawing graph theory (Stephanie van Willigenburg) This talk requires no prior knowledge and will be a gentle introduction to colouring graphs, suitable for a broad audience including students. We will start with some...

Let ord p ( a ) be the order of a in ( Z / p Z ) ∗ . In 1927, Artin conjectured that the set of primes p for which an integer a ≠ − 1 , ◻ is a primitive root (i.e. ord p ( a ) = p − 1 ) has a positive asymptotic density among all primes. In 1967...

Over the years, there have been several open problems involving polynomials that I would love to tell others about. This opportunity to speak at my “home ground” seems the perfect time to do so. More specifically, I will discuss the following: A...