webnotice

Friday, February 6, 2026 3:30 pm - 4:30 pm EST (GMT -05:00)

Geometry and Topology Seminar

Duncan McCoy, Université du Québec à Montréal

The unknotting number of positive alternating knots

The unknotting number is simultaneously one of the simplest classical knot invariants to define and one of the most challenging to compute. This intractability stems from the fact that typically one has no idea which diagrams admit a collection of crossing changes realizing the unknotting number for a given knot. For positive alternating knots, one can show that if the unknotting number equals the lower bound coming from the classical knot signature, then the unknotting number can be calculated from an alternating diagram. I will explain this result along with some of the main tools in the proof, which are primarily from smooth 4-dimensional topology. This is joint work with Paolo Aceto and JungHwan Park.

MC 5417

Thursday, February 5, 2026 4:00 pm - 5:20 pm EST (GMT -05:00)

Analysis Seminar

Kostiantyn Drach, Universitat de Barcelona

Reverse inradius inequalities for ball-bodies

A ball-body, also called a $\lambda$-convex body, is an intersection of congruent Euclidean balls of radius $1/\lambda$ in $\mathbb{R}^n$, $n \geq 2$. Such bodies arise naturally in optimization problems in combinatorial and convex geometry, in particular when the number of generating balls is finite. In recent years, ball-bodies have also played a central role in an active research program on reverse isoperimetric-type problems under curvature constraints. The general objective of this program is to understand how prescribed curvature bounds restrict the extremal behavior of geometric functionals (e.g., volume, surface area, or mean width), and to identify sharp inequalities between them that reverse the existing classical isoperimetric-type inequalities. In this talk, we focus on the inradius minimization problem for $\lambda$-convex bodies with prescribed surface area or prescribed mean width. Here, the inradius of a convex body $K$ is the radius of the largest ball contained in $K$. In this setting, we establish sharp lower bounds for the inradius and show that equality is attained only by lenses, that is, intersections of two balls of radius $1/\lambda$. This solves a conjecture of Karoly Bezdek. We will outline the main ideas of the proof and pose several open problems. This is joint work with Kateryna Tatarko.

MC 5417

Tuesday, February 3, 2026 10:00 am - 11:00 am EST (GMT -05:00)

Number Theory Seminar

Carlo Pagano, Concordia University

Reconstructing curves from their Galois set of points

We will talk about reconstructing a generic pair of elliptic curves over a number field K from their Galois module of K-bar points.

MC 5479

Tuesday, February 3, 2026 2:00 pm - 5:00 pm EST (GMT -05:00)

Model Theory Working Seminar

Fateme Peimany and/or Jules Ribolzi, University of Waterloo

Meromorphic groups

We redefine meromorphic groups as group objects in the category of abstract meromorphic varieties, and check this agrees with the notion introduced by Pillay-Scanlon.

MC 5479

Tuesday, January 27, 2026 3:30 pm - 5:00 pm EST (GMT -05:00)

Learning Seminar

Leigh Foster, University of Waterloo

Learning Seminar on lozenge tilings and the single dimer model

The study of lozenge tilings and of the dimer model is a well-established area of research, going back to the 1960's and

still subject to active research at present. (Some references, also showing connections to other directions of research,

are listed below.) We will start the learning seminar on this topic with a series of three meetings giving an introduction

to the dimer model in its single-dimer version, and considered on a finite hexagonal grid.

--In the first meeting, on January 27, we will introduce the single dimer model and we will discuss its connection to other

combinatorial objects, with particular emphasis on the connection between the dimer model and the notion of "stack of

boxes".

--In the second meeting, on February 3, we will discuss enumeration questions related to the configurations introduced

in the preceding week.

--The third meeting, on February 10, will be open to requests from the audience. One potential direction for this meeting

will be to look at some probabilistic results on random dimer configurations of a given shape, as well as various limit shape

phenomena, pointing to the study od some intriguing objects called "amoebas".

The learning seminar is intended to continue after the reading week, covering the more recent research topic of double-dimer

and more generally multiple-dimer models.

The seminar is addressed to all interested audiences, with very few assumptions regarding background knowledge.

Come, listen and ask questions - everyone is welcome, and interruptions are hoped for!

MC 5403

Monday, March 30, 2026 2:30 pm - 4:00 pm EDT (GMT -04:00)

Pure Math Colloquium

Damaris Schindler, University of Göttingen

Density of rational points near manifolds

Given a bounded submanifold M in R^n, how many rational points with common bounded denominator are there in a small thickening of M? How does this counting function behave if we let the size of the denominator go to infinity? The study of the density of rational points near manifolds has seen significant progress in the last couple of years. In this talk I will explain why we might be interested in this question, focusing on applications in Diophantine approximation and the (quantitative) arithmetic of projective varieties.

MC 5403

Monday, February 2, 2026 2:30 pm - 4:00 pm EST (GMT -05:00)

Pure Math Colloquium

Luke Postle, University of Waterloo

A New Proof of the Existence Conjecture and its Applications to Extremal and Probabilistic Design Theory

We discuss the recently developed method of refined absorption and how it is used to provide a new proof of the Existence Conjecture for combinatorial designs. This method can also be applied to resolve open problems in extremal and probabilistic design theory while providing a unified framework for these problems. Crucially, the main absorption theorem can be used as a ``black-box'' in these applications obviating the need to reprove the absorption step for each different setup.

MC 5403

Monday, February 2, 2026 1:00 pm - 2:30 pm EST (GMT -05:00)

Computability Learning Seminar

Beining Mu, University of Waterloo

Algorithmic randomness and Turing degrees 3

In this seminar we talk about coding strategies to encode an arbitrary set into a 1-random set in a sense that every set is wtt-reducible to a 1-random set. We will also have a review of the jump operator and lowness of Turing degrees to explore the distribution of 1-random sets in terms of Turing degrees.

MC 5403

Tuesday, March 31, 2026 10:00 am - 11:00 am EDT (GMT -04:00)

Number Theory Seminar

Damaris Schindler, University of Göttingen

Quantitative weak approximation and quantitative strong approximation for certain quadratic forms

In this talk we discuss recent results on optimal quantitative weak approximation for certain projective quadrics over the rational numbers as well as quantitative results on strong approximation for quaternary quadratic forms over the integers. We will also discuss results on the growth of integral points on the three-dimensional punctured affine cone and strong approximation with Brauer-Manin obstruction for this quasi-affine variety. This is joint work with Zhizhong Huang and Alec Shute.

MC 5479

Tuesday, January 27, 2026 10:00 am - 11:00 am EST (GMT -05:00)

Number Theory Seminar

Erica Liu, University of Waterloo

Toric Compactifications and Critical Points at Infinity in Analytic Combinatorics

The field of Analytic Combinatorics in Several Variables (ACSV) provides powerful tools for deriving asymptotic information from multivariate generating functions. A key challenge arises when standard saddle-point techniques fail due to the presence of critical points at infinity (CPAI), obstructing local analyses near singularities. Recent work has shown that Morse-theoretic decompositions remain valid under the absence of CPAI, traditionally verified using projective compactifications. In this talk, I will present a toric approach to compactification that leverages the Newton polytope of a generating function to construct a toric variety tailored to the function’s combinatorial structure. This refinement not only tightens classification of CPAI but also enhances computational efficiency. Through concrete examples and an introduction to tropical and toric techniques, I will demonstrate how these methods clarify the asymptotic landscape of ACSV problems, especially in combinatorially meaningful settings. This talk draws on joint work studying toric compactifications as a bridge between algebraic geometry and analytic combinatorics.

MC 5479