webnotice

Tuesday, October 25, 2022 12:30 pm - 12:30 pm EDT (GMT -04:00)

Algebraic Geometry Working Seminar

Robert Harris, Department of Pure Mathematics, University of Waterloo

"Abelian Covers and Line Arrangements in CP^2"

Monday, October 31, 2022 2:30 pm - 2:30 pm EDT (GMT -04:00)

Colloquium

Joseph H. Silverman, Brown University

"Finite Orbits of Points on Surfaces that Admit Three Non-commuting Involutions"

Thursday, October 27, 2022 2:30 pm - 2:30 pm EDT (GMT -04:00)

Geometry & Topology Seminar

Ethan Cotterill, University of Campinas

"Cuspidal curves in P^n, and partition arithmetic"

Thursday, October 20, 2022 1:00 pm - 1:00 pm EDT (GMT -04:00)

Horospherical MMP Seminar

Nicole Kitt, Department of Pure Mathematics, University of Waterloo

"Morphisms of horospherical varieties"

In this talk, we define and look at examples of morphisms of horospherical varieties. Additionally, we will see how morphisms of horospherical varieties are related to maps of the coloured fans.

This seminar will be held jointly online and in person:

Friday, October 21, 2022 10:30 am - 10:30 am EDT (GMT -04:00)

Logic Seminar

Ross Willard, Department of Pure Mathematics, University of Waterloo

"Finite axiomatizability problems for finite algebras"

Friday, October 21, 2022 4:30 pm - 4:30 pm EDT (GMT -04:00)

Pure Math Grad Colloquium

Xingchi Ruan, Department of Pure Mathematics, University of Waterloo

"Lower bounds on solubility of Diophantine systems"

Given a system of r homogeneous polynomial equations with degree d with rational coefficients, we study the number of variables it needs to possess a non-trivial p-adic solution. We focus on the lower bound of this number. We learn the history and prototype of the problem, as well as the most precise estimation of the lower bound so far.

MC 5479

Tuesday, October 18, 2022 10:00 am - 10:00 am EDT (GMT -04:00)

Student Number Theory Seminar

Owen Sharpe, Department of Pure Mathematics, University of Waterloo

"Primality Testing and Integer Factorization"

Primality testing and integer factorization are mathematical problems which have occupied number theorists throughout the centuries. They have become very important in the field of cryptography over the last fifty years. We give a brief history of primality testing and integer factorization algorithms, from the sieve of Eratosthenes to the AKS test, and from trial division to Shor's algorithm.