Contact Info
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
Sun | Mon | Tue | Wed | Thu | Fri | Sat |
---|---|---|---|---|---|---|
27
|
28
|
29
|
30
|
31
|
2
|
|
|
|
|
|
|
|
|
3
|
4
|
6
|
9
|
|||
|
|
|
|
|||
10
|
11
|
12
|
16
|
|||
|
|
|
|
|||
17
|
18
|
20
|
21
|
22
|
23
|
|
|
|
|
|
|
|
|
24
|
25
|
1
|
2
|
|||
|
|
|
|
Title: 2-approximation of chromatic number on graph classes excluding a minor
Speaker: Rose McCarty Affiliation: University of Waterloo Room: MC 5479Abstract: In this talk we will see a 2-approximation of the chromatic number of graphs excluding a fixed minor.
Title: Eigenvalue bounds to the (co)clique and chromatic numbers
Speaker: Gabriel Coutinho Affiliation: Federal University of Minas Gerais, Brazil Room: MC 5501Abstract:
This is perhaps one of the oldest topics of interest in spectral graph theory, dating back to the works of Hoffman, Haemers, Delsarte and others, in the 70s.
Title: Applications of the entropy method: Brégman's theorem
Speaker: Jorn van der Pol Affiliation: University of Waterloo Room: MC 6486Abstract: Following Section 5 of Galvin's notes on Entropy and Counting,
Title: Permutation Problems, Chessboards, and Rook Equivalence
Speaker: Caelan Wang Affiliation: University of Waterloo Room: MC 6486Abstract: We discuss the motivation and development of the theory around rook polynomials.
Title:‘Coloring 3-colorable graphs with o(n^1⁄5) colors’ by Kawarabayashi and Thorup
Speaker: Tom Kelly Affiliation: University of Waterloo Room: MC 5479Abstract: Much attention has been devoted to nding polynomial time algorithms for coloring three-
colorable graphs with the fewest possible colors.
Title: The rank of random matrices over finite fields
Speaker: Jane Gao Affiliation: University of Waterloo Room: MC 5501Abstract:
We determine the rank of a random matrix over a finite field with prescribed numbers of non-zero entries in each row and column. As an application we obtain a formula for the rate of low-density parity check codes.
Title: Circle graphs are quadratically x-bounded
Speaker: James Davies Affiliation: University of Waterloo Room: **New Room** MC 5501Abstract: A circle graph $G$ is an intersection graph of a set of chords on a circle.
Title: Quantum Walks, State Transfer, and Entanglement
Speaker: Christopher van Bommel Affiliation: University of Waterloo Room: MC 6486Abstract: Quantum walks are the quantum analogues of classical random walks and can be used to model quantum computations.
Title: Coloring 3-colorable graphs with o(n^1/5) colors
Speaker: Sharat Ibrahimpur Affiliation: University of Waterloo Room: MC 5479Abstract: This is the second part of the seminar on recent results obtained by Kawarabayashi and Thorup
Title: Applications of the entropy method: Counting proper colorings of a regular graph
Speaker: Jane Gao Affiliation: University of Waterloo Room: MC 6486Abstract: Following Section 6 of Galvin's notes on Entropy and Counting, we will explore Galvin and Tetali’s tight upper bound
Title: Bounding Dedekind numbers with entropy
Speaker: John Schanck Affiliation: University of Waterloo Room: MC 6486Abstract: The Dedekind numbers (sequence A000372 in the OEIS)
Title: Cyclic flat approach to matroid base polytopes
Speaker: Ahmed Ashraf Affiliation: Western University Room: MC 5501Abstract: Ardila, Benedetti and Doker realised matroid polytopes as generalized permutohedra, and using the work of Postnikov,
Title: Difference-of-SOS and Difference-of-Convex-SOS Decomposition Techniques for Polynomials
Speaker: Yi-Shuai Niu Affiliation:SJTU-Paristech & Maths department Shanghai Jiao Tong University
Room: MC 5501Abstract:
We are interested in polynomial decomposition techniques for reformulating any multivariate polynomial into difference-of-sums-of-squares (DSOS) and difference-of-convex-sums-of-squares (DCSOS) polynomials.
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.