Friday, December 6, 2013 — 3:30 PM EST
Behavioral Cascades with Opposing Influences
Speaker: |
Hamid Mahini |
---|
Affiliation: |
University of Maryland |
---|
Room: |
Mathematics and Computer Building (MC) 5158 |
---|
Abstract:
Thursday, November 28, 2013 — 1:00 PM EST
Linear Cayley Graphs, Codes and Geometry
Speaker: |
Mario Huang |
---|
Affiliation: |
University of Waterloo |
---|
Room: |
Mathematics and Computer Building (MC) 5136 |
---|
Abstract:
Monday, November 25, 2013 — 4:00 PM EST
Ear-decompositions of nonbipartite matching-covered graphs
Speaker: |
Nishad Kothari |
---|
Affiliation: |
University of Waterloo |
---|
Room: |
Mathematics and Computer Building (MC) 5168 |
---|
Abstract:
Friday, November 22, 2013 — 3:30 PM to 4:30 PM EST
Some wonderful conjectures (but very few theorems) at the boundary between analysis, combinatorics and probability
Speaker: |
Andrew Childs |
---|
Affiliation: |
University of Waterloo |
---|
Room: |
Mathematics and Computer Building (MC) 5158 |
---|
Thursday, November 21, 2013 — 1:00 PM EST
University theorem for polynomial invartiants on ribbon graphs with flags.
Speaker: |
Avohou Remi Cocou |
---|
Affiliation: |
University d'Abomey Calavi |
---|
Room: |
Mathematics and Computer Building (MC) 5136 |
---|
Abstract:
In my presentation, I will recall the Bollobas-Riordan polynomial
for ribbon graphs and its universality property. This polynomial finds
Friday, November 15, 2013 — 3:30 PM to 4:30 PM EST
Solution geometry of a random k-XORSAT near the clustering threshold
Speaker: |
Jane Gao |
---|
Affiliation: |
University of Toronto |
---|
Room: |
Mathematics and Computer Building (MC) 5158 |
---|
Abstract
Friday, November 8, 2013 — 3:30 PM to 4:30 PM EST
Counting Connected Uniform Hypergraphs
Speaker: |
Christiane Sato |
---|
Affiliation: |
University of Waterloo |
---|
Room: |
Mathematics and Computer Building (MC) 5158 |
---|
Abstract:
Tuesday, November 5, 2013 — 3:30 PM to 4:30 PM EST
Sparsity and gauge optimization
Speaker: |
Michael P. Friedlander |
---|
Affiliation: |
Department of Computer Science, University of British Columbia |
---|
Room: |
Mathematics and Computer Building (MC) 5158 |
---|
Abstract:
Tuesday, November 5, 2013 — 2:30 PM to 3:30 PM EST
Recent Results on Tensor and Polynomial Optimization
Speaker: |
Shuzhong Zhang |
---|
Affiliation: |
University of Minnesota |
---|
Room: |
Mathematics and Computer Building (MC) 5158 |
---|
Abstract
Friday, November 1, 2013 — 3:30 PM to 4:30 PM EDT
Finding small stabilizers for unstable graphs
Speaker: |
Andrew Childs |
---|
Affiliation: |
University of Waterloo |
---|
Room: |
Mathematics and Computer Building (MC) 5158 |
---|
Abstract:
A vertex v of a graph G is called inessential if there exists a maximum matching in G that exposes v. G is said to be stable if the set of its inessential vertices forms a stable set.
Friday, October 25, 2013 — 3:30 PM to 4:30 PM EDT
Solution geometry of a random k-XORSAT near the clustering threshold
Speaker: |
Jane Gao |
---|
Affiliation: |
University of Waterloo |
---|
Room: |
Mathematics and Computer Building (MC) 5158 |
---|
Abstract:
Since early 2000s statistical physicists predicted, using a non-rigorous
technique called the "cavity method", that the solution spaces of many
Thursday, October 24, 2013 — 1:00 PM to 2:30 PM EDT
Problems in Algebraic Graph Theory
Speaker: |
Chris Godsil |
---|
Affiliation: |
University of Waterloo |
---|
Room: |
Mathematics and Computer Building (MC) 5158 |
---|
Abstract:
Problems in algebraic graph theory will be discussed.
Friday, October 18, 2013 — 3:30 PM to 4:30 PM EDT
Faster private release of marginals on small databases
Speaker: |
Professor Karthekeyan Chandraskearan |
---|
Affiliation: |
Harvard University |
---|
Room: |
Mathematics and Computer Building (MC) 5158 |
---|
Abstract:
Thursday, October 17, 2013 — 3:30 PM to 4:30 PM EDT
Stable Polynomials and Ramanujan Graphs
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.)
Friday, October 11, 2013 — 3:30 PM to 4:30 PM EDT
The Boundary Structure of Spectrahedra Arising from the Lovász Theta Function
Speaker: |
Marcel Silva |
---|
Affiliation: |
University of Waterloo |
---|
Room: |
Mathematics and Computer Building (MC) 5158 |
---|
Abstract:
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),
Thursday, October 10, 2013 — 3:30 PM to 4:30 PM EDT
A Proof of the Manickam-Mikl\'{o}s-Singhi Conjecture for Vector Spaces
Speaker: |
Ameera Chowdhury |
---|
Affiliation: |
Carnegie Melon University |
---|
Room: |
Mathematics and Computer Building (MC) 5158 |
---|
Abstract:
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
Friday, October 4, 2013 — 3:30 PM to 4:30 PM EDT
Rota's Conjecture
Speaker: |
Jim Geelen |
---|
Affiliation: |
University of Waterloo |
---|
Room: |
Mathematics and Computer Building (MC) 5158 |
---|
Abstract:
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.
Thursday, October 3, 2013 — 3:30 PM to 4:30 PM EDT
Stable Polynomials and Ramanujan Graphs
Speaker: |
Andrew Childs |
---|
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 first of two lectures.)
Friday, September 27, 2013 — 3:30 PM to 4:30 PM EDT
The Rim Hook Rule: Relating Quantum Cohomology of the Grassmannian to Ordinary Cohomology of the Grassmannian
Speaker: |
Anna Bertiger |
---|
Affiliation: |
University of Waterloo |
---|
Room: |
Mathematics and Computer Building (MC) 5158 |
---|
Abstract:
Friday, September 20, 2013 — 3:30 PM to 4:30 PM EDT
Line arrangements and intersection theory on algebraic surfaces
Speaker: |
Eric Katz |
---|
Affiliation: |
University of Waterloo |
---|
Room: |
Mathematics and Computer Building (MC) 5158 |
---|
Abstract:
Thursday, September 19, 2013 — 1:00 PM to 2:30 PM EDT
Matching Polynomials, Real Stable Polynomials and Ramanujan Graphs
Speaker: |
Chris Godsil and Dave Wagner |
---|
Affiliation: |
University of Waterloo |
---|
Room: |
Mathematics and Computer Building (MC) 5158 |
---|
Abstract:
Friday, September 13, 2013 — 3:30 PM to 4:30 PM EDT
3-Coloring and 3-List-Coloring Graphs of Girth at least Five on Surfaces
Speaker: |
Luke Postle |
---|
Affiliation: |
University of Waterloo and Emory University |
---|
Room: |
Mathematics and Computer Building (MC) 5158 |
---|
Abstract:
Tuesday, August 20, 2013 — 1:30 PM to 2:30 PM EDT
Connectivity and matching properties of distance-regular graphs
Speaker: |
Sebi Ciaoba |
---|
Affiliation: |
University of Delaware |
---|
Room: |
Mathematics and Computer Building (MC) 5158 |
---|
Abstract:
Tuesday, August 13, 2013 — 3:30 PM to 4:30 PM EDT
Frozen vertices in colourings of a random graph
Speaker: |
Mike Molloy |
---|
Affiliation: |
University of Toronto |
---|
Room: |
Mathematics and Computer Building (MC) 5158 |
---|
Abstract:
Monday, July 29, 2013 (all day) to Friday, August 2, 2013 (all day)
Flexible network design
Topics include
- Theoretical computer science
- Graph algorithms
- Discrete optimization
Local organizers
- Joseph Cheriyan (Waterloo)
- Anupam Gupta (Carnegie Mellon)
- Jochen Könemann (Waterloo)
- Stefano Leonardi (Sapienza U. of Rome)
- R. Ravi (Carnegie Mellon)
- Laura Sanita (Waterloo)
- Chaitanya Swamy (Waterloo)
Plenary speakers
- Julia Chuzhoy (Toyota Technological Institute at Chicago)