Please email any errors or updates to our website support/editor.
PDF files require Adobe Acrobat Reader.
Visit our COVID-19 information website to learn how Warriors protect Warriors.
Please note: The University of Waterloo is closed for all events until further notice.
Title: Presenting a tangle
Title: Arc-transtive cubic graphs
Speaker: | Krystal Guo |
Affiliation: | University of Waterloo |
Room: | MC 6486 |
Abstract: We will look at a classical result of Tutte in his seminal paper "A Family of Cubic Graphs"; every cubic arc-transitive graph is s-arc-regular for some s between 1 and 5.
Title: Arc-transtive cubic graphs
Speaker: | Krystal Guo |
Affiliation: | University of Waterloo |
Room: | MC 6486 |
Abstract: We will look at a classical result of Tutte in his seminal paper "A Family of Cubic Graphs"; every cubic arc-transitive graph is s-arc-regular for some s between 1 and 5.
Title: Representation stability for the cohomology of arrangements
Title: Gallai's path decomposition conjecture
Title: The mathematics of juggling
Speaker: | Gabriel Gauthier-Shalom |
Affiliation: | University of Waterloo |
Room: | MC 6486 |
Abstract: Siteswap is a mathematical notation for juggling patterns that is
natural, simple, and useful in practice. I will be presenting an overview of
this topic and its connections with other areas of mathematics. There will be demonstrations!
Title: Recognizing frame matroids
Title: The matroid secretary problem for minor-closed classes
Title: McMullen's proof of the g-theorem for polytonal spheres
Title: Principal angles and vectors of two subspaces
Title: Graphs are to matroids as embedded graphs are to what?
Title: The replication conjecture II
Title: Strongly regular subconstituents of strongly regular graphs
Title: Hopf algebras, colorings and simplicial complexes
Title: The perfect matching polytope and solid graphs
Title: On some polytopes contained in the 0,1 hypercube that have a small
chvatal rank
Title: A unified Erd\H os-P\'osa theorem for constrained cycles
Title: Introduction to association schemes
Speaker: | Krystal Guo |
Affiliation: | University of Waterloo |
Room: | MC 6486 |
Abstract: The theory of association schemes is an important toolbox for algebraic graph theory. We will give an introduction to association scheme, distance regular graphs and the clique-coclique bound.
Title: My favorite number
Speaker: | John Baez |
Affiliation: | University of California, Riverside |
Room: | DC 1302 |
Abstract: The number 24 plays a central role in mathematics thanks to a series of "coincidences" that is just beginning to be understood. One of the first hints of this fact was Euler's bizarre "proof" that
1\^ + 2\^ + 3\^ + 4\^ + … = -1/12\^
Title: The Replication Conjecture
Speaker: | Ahmad Abdi |
Affiliation: | University of Waterloo |
Room: | MC 5417 |
Abstract: In 1972, Lovasz proved a key lemma that was the piece of the puzzle Fulkerson missed to prove the weak perfect graph theorem. This important lemma, called the Duplication Lemma, simply states that vertex duplication preserves graph perfection.
Title: Matroid perspectives and graph polynomials
Title: Claw decompositions of random 4-regular graphs
Title: Quantum walks and graph embeddings
Title: Trees, chord diagrams and the renormalization group equation
Speaker: | Karen Yeats |
Affiliation: | Simon Fraser University |
Room: | MC 5417 |
Abstract: How far can we get in understanding perturbative expansions in quantum field theory combinatorially?
Please email any errors or updates to our website support/editor.
PDF files require Adobe Acrobat Reader.
The University of Waterloo acknowledges that much of our work takes place on the traditional territory of the Neutral, Anishinaabeg and Haudenosaunee peoples. Our main campus is situated on the Haldimand Tract, the land granted to the Six Nations that includes six miles on each side of the Grand River. Our active work toward reconciliation takes place across our campuses through research, learning, teaching, and community building, and is centralized within our Indigenous Initiatives Office.