Events

Filter by:

Limit to events where the title matches:
Limit to events where the first date of the event:
Date range
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Speaker: Adam Van Tuyl
Affiliation: McMaster University
Location: MC 5501

Abstract: Vertex decomposable simplicial complexes and geometrically vertex decomposable ideals have a lot of nice structure: they are shellable and Cohen–Macaulay, and the ideal version is also radical and glicci. There are many ways to attach an ideal to a graph, such as edge ideals, toric ideals, binomial edge ideals and star configurations, and the goal is to exploit the graph structure to decide whether the ideal is (geometrically) vertex decomposable. I will introduce these notions from scratch, with no commutative algebra assumed, and survey recent joint work, including a computer search of all graphs on 11 vertices and a conjecture for binomial edge ideals.  

Monday, November 9, 2026 3:00 pm - 4:00 pm EST (GMT -05:00)

Graphs and Matroids | Jim Geelen, An introduction to Rota’s Basis Conjecture

Speaker: Jim Geelen
Affiliation: University of Waterloo
Room: MC 6029

Abstract: I will give a turorial-style talk on Rota’s Basis Conjecture focusing on an old result, due independently to Huang and Rota and to Onn, who "all-but proved" Rota’s Basis Conjecture for real-representable matroids.

Speaker: Huanhuan Chen &Bruce Xu
Affiliation: University of Waterloo
Room: MC 5501

Abstract: This talk introduces fundamental techniques for proving security in classical cryptography, with an emphasis on game hopping and the random oracle model. We will discuss how security arguments are structured as sequences of games and how the random oracle model simplifies the analysis of cryptographic constructions. As a first example, we will examine how a random oracle can be used to construct a secure pseudorandom function (PRF) and subsequently a message authentication code (MAC). As a second example, we will explore the role of the random oracle in the Fujisaki–Okamoto transformation and its security proof.

Speaker: Zachary Hamaker
Affiliation: University of Florida
Location: MC 5417

Abstract: Schubert polynomials are monomial positive representatives for the classes of Schubert varieties in the complete flag variety. As such, they are a key tool for computation in Schubert calculus, an area of enumerative algebraic geometry. There are several combinatorial proofs of the monomial positivity of Schubert polynomials, but the first geometric explanation came much later in foundational work of Knutson and Miller. In this talk, I will discuss how to understand combinatorial formulas for Schubert polynomials via Grobner degeneration. This includes the Knutson-Miller work as well as related results by Klein-Weigandt and some work in progress. Results of mine presented come from two projects, one joint with Oliver Pechenik and Anna Weigandt, the other with Gabe Udell and Tianyi Yu.

There will be a pre-seminar presenting relevant background at beginning graduate level starting at 1:30pm in MC 5417.

Speaker: Kateryna Tatarko
Affiliation: University of Waterloo
Location: MC 5501

Abstract: The classical isoperimetric problem states that the Euclidean ball has the largest volume among all convex bodies of a fixed surface area. What if we ask for the smallest volume instead? Without additional constraints, the volume can be arbitrarily small. We will discuss this reverse question for the intersections of balls of fixed radius, the class of convex bodies for which the question becomes meaningful. In particular, we will show that a lens, the intersection of two balls, minimizes the volume for a prescribed surface area in this class. 

Monday, November 16, 2026 11:00 am - 12:00 pm EST (GMT -05:00)

CombOpt Reading Group | Mehrdad Sohrabi, Approximating graphic TSP by b-matchings

Speaker:

Mehrdad Sohrabi

Affiliation: University of Waterloo
Room: MC 6029

Abstract: We are going to talk about approximating graphic TSP, which is a variant of TSP where the distances come from shortest paths between vertices of an undirected graph. We will talk about Mömke and Svensson’s approach, which used matchings to improve the approximation ratio, and also our recent generalization that uses b-matchings. This is joint work with Levent Tunçel and Swati Gupta.

Monday, November 16, 2026 3:00 pm - 4:00 pm EST (GMT -05:00)

Graphs and Matroids | Cece Henderson, On the Hypergraph Nash-Williams' Conjecture

Speaker: Cece Henderson
Affiliation: University of Waterloo
Room: MC 6029

Abstract: The study of combinatorial designs includes some of the oldest questions at the heart of combinatorics. In a breakthrough result of 2014, Keevash proved the longstanding Existence Conjecture by showing the existence of (n,q,r)-Steiner systems (equivalently K_q^r-decompositions of K_n^r) for all large enough n satisfying the necessary divisibility conditions. Meanwhile, in recent decades, incremental progress has been made on the celebrated Nash-Williams' Conjecture of 1970, which posits that any large enough, triangle-divisible graph on n vertices with minimum degree at least 3n/4 admits a triangle decomposition. In 2021, Glock, Kühn, and Osthus proposed a generalization of these results by conjecturing a hypergraph version of the Nash-Williams' Conjecture, where their proposed minimum degree K_q^r-decomposition threshold is motivated by hypergraph Turán theory. By using the recently developed method of refined absorption and establishing a non-uniform Turán theory, we tie the K_q^r-decomposition threshold to its fractional relaxation. Combined with the best-known fractional decomposition threshold from Delcourt, Lesgourgues, and Postle, this dramatically closes the gap between what was known and the above conjecture. This talk is based on joint work with Luke Postle.

Speaker: Jonas Janneck & Camryn Steckel
Affiliation: University of Waterloo
Room: MC 5501

Abstract: A lot of classical constructions are proven secure the random oracle model. With quantum adversaries, it is necessary to consider a quantum-accessible model allowing the adversary to query the oracle with quantum states. In this talk, we define such an oracle and show its implications on classical security proofs. We will present an example separating the classical and quantum-accessible random oracle models using a scheme that is secure when the adversary is given classical access to the random oracle, but is insecure when they can make quantum oracle queries. We further define history-free reductions and show that there is a general lifting result allowing to argue security in the quantum random oracle model when there is a reduction in the classical setting. As an example for this technique we will show how to prove the security of signatures following the Full Domain Hash paradigm.

Speaker: Andy Zucker
Affiliation: University of Waterloo
Location: MC 5417

Abstract: A 1976 theorem of Nesetril and Rodl proves that the class of k-clique-free finite graphs has the ordering property. In this talk, we will define the ordering property and give a probabilistic argument that it holds. We then discuss how a 2005 paper of Kechris, Pestov, and Todorcevic applies the ordering property to topological dynamics.

There will be a pre-seminar presenting relevant background at beginning graduate level starting at 1:30pm in MC 5417.

Friday, November 20, 2026 3:30 pm - 4:30 pm EST (GMT -05:00)

Tutte Colloquium | Andy Zucker, A survey of structural Ramsey theory

Speaker: Andy Zucker
Affiliation: University of Waterloo
Location: MC 5501

Abstract: Ramsey's celebrated theorem has two forms — an infinite version and a finite one. A natural way to try to generalize the theorem is to color substructures of a given structure, rather than just subsets of a given set. A 1977 theorem of Nesetril and Rodl provides a sweeping generalization of the finite version of Ramsey's theorem to all relational free-amalgamation classes of finite structures. For the infinite version, things get much more complicated. While a 2022 theorem of mine proves a generalization of the infinite version for finitely-constrained binary free-amalgamation classes, the result in full generality is false dropping either the finite-constraint assumption or the binary assumption. Time permitting, I will discuss joint work with Joey Lakerdas-Gayle discussing some of the strange things that can happen for infinitely-constrained binary free-amalgamation classes.