Contact Info
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
A celebration of Goulden and Jackson's combined 90 years of insight and inspiration that have shaped the fields of algebraic and combinatorial enumeration.
To register, click here.
Title: Faster Algorithms for Isogeny Problems using Torsion Point Images.
Speaker: | Dinesh Valluri |
Affiliation: | University of Waterloo |
Attend: | Contact Jesse Elliott |
Abstract:
In this talk, we will discuss cryptanalysis of some SIDH-type protocols due to Christophe Petit: https://eprint.iacr.org/2017/571.pdf. While finding isogenies between supersingular elliptic curves remains computationally hard to solve, knowledge of images of specific torsion points by the unknown isogeny helps build faster attacks.
Title: Early Work
Speaker: | Ian Goulden |
Affiliation: | University of Waterloo |
Location: | QNC 0101 or please contact Emma Watson for Zoom link |
Abstract:
I will talk briefly and informally about my work in the last century.
Title: At It and In It
Speaker: | David Jackson |
Affiliation: | University of Waterloo |
Location: | QNC 0101 or please contact Emma Watson for Zoom link |
Abstract:
I have selected seven Research Themes to talk about very briefly and informally. They are reflections upon key moments and surprising revelations over the past forty years.
Title: An overview of complex unit gain graphs and their spectra
Speaker: |
Aniruddha Samanta |
Affiliation: |
Indian Statistical Institute Bangalore |
Zoom: | Contact Sabrina Lato for link |
Abstract:
In this talk, we will study complex unit gain graphs via the spectra of various classes of matrices associated with them. A complex unit gain graph (or T-gain graph), Φ = (G, φ) is a graph where the function φ assigns a unit complex number to each orientation of an edge of G, and its inverse is assigned to the opposite orientation. We will give an overview of several spectral properties of T-gain graphs.
Title: Colouring binary matroids
Speaker: | Jim Geelen |
Affiliation: | University of Waterloo |
Room: | MC 5417 |
Abstract:
I will give an introduction to critical number for binary matroids and will discuss two of my favourite conjectures on the topic. No prior knowledge of matroids will be assumed.
Title: Cyclic sieving with focus on open problems
Speaker: |
Per Alexandersson |
Affiliation: |
Stockholm University |
Room/Zoom: | MC5479 or for Zoom link contact Logan Crew or Olya Mandelshtam |
Abstract:
The cyclic sieving phenomenon (CSP) connects a cyclic group action on a family of combinatorial objects with some q-analog of that set. We discuss some recent results and open problems for standard and semistandard tableaux, as well as some other families of combinatorial objects.
Several open problems with various levels of difficulty will be presented.
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
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 Office of Indigenous Relations.