Contact Info
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
Speaker: | Jane Gao |
---|---|
Affiliation: | University of Waterloo |
Room: | Mathematics and Computer Building (MC) 5158 |
Since early 2000s statistical physicists predicted, using a non-rigorous
technique called the "cavity method", that the solution spaces of many
Speaker: | Chris Godsil |
---|---|
Affiliation: | University of Waterloo |
Room: | Mathematics and Computer Building (MC) 5158 |
Problems in algebraic graph theory will be discussed.
Speaker: | Professor Karthekeyan Chandraskearan |
---|---|
Affiliation: | Harvard University |
Room: | Mathematics and Computer Building (MC) 5158 |
Speaker: | David Wagner |
---|---|
Affiliation: | University of Waterloo |
Room: | Mathematics and Computer Building (MC) 5158 |
Abstract:
We show how Marcus, Spielman and Srivastava use stable polynomials to construct bipartite Ramunujan graphs of degree $k$ whenever $k\ge3$. (This will be the second of two lectures.)
Speaker: | Marcel Silva |
---|---|
Affiliation: | University of Waterloo |
Room: | Mathematics and Computer Building (MC) 5158 |
The theta body TH(G) of a graph G is a semidefinite relaxation of
STAB(G), the stable set polytope of G, and it is contained in QSTAB(G),
Speaker: | Ameera Chowdhury |
---|---|
Affiliation: | Carnegie Melon University |
Room: | Mathematics and Computer Building (MC) 5158 |
Let $V$ be an $n$-dimensional vector space over a finite field.
Assign a real-valued weight to each $1$-dimensional subspace in $V$ so
Speaker: | Jim Geelen |
---|---|
Affiliation: | University of Waterloo |
Room: | Mathematics and Computer Building (MC) 5158 |
In 1970, Gian-Carlo Rota posed a conjecture giving a succinct
combinatorial characterization of the linear dependencies among a finite set of vectors in a vector space over any given finite field.
Speaker: | Andrew Childs |
---|---|
Affiliation: | University of Waterloo |
Room: | Mathematics and Computer Building (MC) 5158 |
We show how Marcus, Spielman and Srivastava use stable polynomials to
construct bipartite Ramunujan graphs of degree $k$ whenever $k\ge3$. (This will be the first of two lectures.)
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 co-ordinated within our Office of Indigenous Relations.