Events

October 2019

Sun Mon Tue Wed Thu Fri Sat
29
30
1
2
5

6
7
8
9
12

13
14
15
16
17
18
19

20
21
22
23
24
25
26

27
28
29
30
31
1
2

Algebraic Graph Theory Seminar - Ada Chan

Thursday, October 3, 2019 — 1:00 PM EDT

Title: Type II Matrices

Speaker: Ada Chan Affiliation: York University Room: MC 5479

Abstract:

In 1867,  Sylvester defined an {\sl inverse orthogonal matrix} as an $n\times n$ complex matrix $W$ satisfying

Algebraic Combinatorics Seminar - David Wagner

Thursday, October 3, 2019 — 3:00 PM EDT

Title: Discrete diffusion on graphs and real hyperplane arrangements

Speaker: David Wagner Affiliation: University of Waterloo Room: MC 6483

Abstract:

In 2016, Duffy et al. introduced the following process on a graph.  Initially, each vertex has some integer number of chips'' placed there (possibly negative).

Graphs and Matroids Seminar - Lise Turner

Thursday, October 3, 2019 — 4:00 PM EDT

Title:

Speaker: Lise Turner Affiliation: University of Waterloo Room: MC 5501

Abstract:

There are several different notions of what it means for a graph to converge. One popular notion for sparse graphs is Benjamini-Schramm convergence which focuses on local properties of the graphs.

Combinatorial Optimization Reading Group - Ishan Bansal

Friday, October 4, 2019 — 1:00 PM EDT

Title: Greedy Heuristic for Maximizing Submodular Set Functions

Speaker: Ishan Bansal Affiliation: University of Waterloo Room: MC 5417

Abstract:

Several hard combinatorial optimization problems can be posed in the following framework: maximize a submodular function over its domain subject to a cardinality constraint.

Tutte Colloquium - Bruce Richter

Friday, October 4, 2019 — 3:30 PM EDT

Title: Extending drawings of K(n) to pseudolines and pseudocircles

Speaker: Bruce Richter Affiliation: University of Waterloo Room: MC 5501

Abstract:

In the early part of the 21st century, it was shown that the number of crossings in a straight-line drawing of K(n) is at least the number H(n), which is conjectured to be the crossing number of K(n). In fact, it is now known that, for n at least 10, the inequality is strict.

Algebraic Graph Theory Seminar - Chris Godsil

Thursday, October 10, 2019 — 1:00 PM EDT

Title: Quantum Colouring and Derangements

Speaker: Chris Godsil Affiliation: University of Waterloo Room: MC 5479

Abstract:

Work in quantum information has lead to the introduction of quantum colourings.

Algebraic Combinatorics Seminar - Hugh Thomas

Thursday, October 10, 2019 — 3:00 PM EDT

Title: Scattering amplitudes and associahedra

Speaker: Hugh Thomas Affiliation: UQAM Room: MC 5417

Abstract:

The classic approach to scattering amplitudes sums a contribution from a (potentially very large) number of Feynman diagrams.

Graphs and Matroids Seminar - Logan Grout

Thursday, October 10, 2019 — 4:00 PM EDT

Title: A Pseudoforest Analogue of the Strong Nine Dragon Tree Conjecture

Speaker: Logan Grout Affiliation: University of Waterloo Room: MC 5501

Abstract:

In 2016, Jiang and Yang proved the Nine Dragon Tree Conjecture, a strengthening of the classical arboricity result of Nash-Williams (1964). On the way to developing this proof, Fan, Lim Song, and Yang proved an analogous result for decomposing graphs into pseudoforests, which is a strengthening of Hakimi’s Theorem.

Combinatorial Optimization Reading Group - Justin Toth

Friday, October 11, 2019 — 1:00 PM EDT

Title: Maximizing a Monotone Submodular Function subject to a Matroid Constraint

Speaker: Justin Toth Affiliation: University of Waterloo Room: MC 5417

Abstract:

Based on the paper by Calinescu, Chekuri, Pál, and Vondrák of the same title. We will study a randomized $(1-\frac{1}{e})$-approximation algorithm for the titular problem.

Tutte Colloquium - Laurent Poirrier

Friday, October 11, 2019 — 3:30 PM EDT

Title: On the depth of cutting planesOn the depth of cutting planes

Speaker: Laurent Poirrier Affiliation: University of Waterloo Room: MC 5501

Abstract:

We tackle one of the most important open problems in computational integer programming: cut selection.

For four decades, cutting planes were believed to be useful only for structured combinatorial problems. This changed in 1995 when Balas, Ceria and Cornuéjols showed that Gomory cuts could helpfully strengthen the formulation of general integer programming problems. Since then, many other cut generation techniques have been developed, but their practical success has been moderate at best.

October 2019

S M T W T F S
29
30
1
2
5
6
7
8
9
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
1. 2019 (139)
1. October (10)
2. September (15)
3. August (9)
4. July (17)
5. June (18)
6. May (16)
7. April (9)
8. March (24)
9. February (13)
10. January (8)
2. 2018 (138)
1. December (2)
2. November (18)
3. October (14)
4. September (9)
5. August (2)
6. July (10)
7. June (13)
8. May (17)
9. April (9)
10. March (19)
11. February (14)
12. January (11)
3. 2017 (103)
4. 2016 (137)
5. 2015 (136)
6. 2014 (88)
7. 2013 (48)
8. 2012 (39)
9. 2011 (36)
10. 2010 (40)
11. 2009 (40)
12. 2008 (39)
13. 2007 (15)