# Events

## November 2019

Sun Mon Tue Wed Thu Fri Sat
27
28
29
30
31
2

3
4
5
6
9

10
11
12
13
16

17
18
19
20
23

24
25
26
27
28
29
30

### Combinatorial Optimization Reading Group - Zishen Qu

Friday, November 1, 2019 — 1:00 PM EDT

Title: Maximizing non-monotone submodular functions

Speaker: Zishen Qu Affiliation: University of Waterloo Room: MC 5417

Abstract:

Optimization of non-monotone submodular functions has applications in the maximum cut and maximum directed cut problems for graphs.

### Tutte Collouium - Luke Schaeffer

Friday, November 1, 2019 — 3:30 PM EDT

Title: A Quantum Query Complexity Trichotomy for Regular Languages

Speaker: Luke Schaeffer Affiliation: University of Waterloo Room: MC 5501

Abstract:

We consider the quantum query complexity of regular languages and discover a surprising trichotomy: each regular language has query complexity either Theta(1), ~Theta(sqrt(n)) or Theta(n).

### Algebraic Graph Theory Seminar - Chris Godsil

Thursday, November 7, 2019 — 1:00 PM EST

Title: Cospectral and strongly cospectral vertices

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

Abstract:

If $a$ is a vertex in a graph with adjacency matrix $A$, the \textsl{walk module} generated by $a$ is the $A$-invariant subspace spanned by the vectors $A^re_a$, for $r\ge0$.

### Algebraic Combinatorics Seminar - Kevin Purbhoo

Thursday, November 7, 2019 — 3:00 PM EST

Title: Two-colouring hypersurface complements in open Richardson varities

Speaker: Kevin Purbhoo Affiliation: University of Waterloo Room: MC 5417

Abstract:

Given an algebraic hypersurface $H \subset \mathbb{R}^n$, we can always 2-colour the components of the complement $\mathbb{R}^n \setminus H$ such that adjacent components are of opposite colours.

### Graphs and Matroids Seminar - Adam Brown

Thursday, November 7, 2019 — 4:00 PM EST

Title: Counting Pentagons in Triangle-free Binary Matroids

Speaker: Adam Brown Affiliation: University of Waterloo Room: MC 5501

Abstract:

Every triangle-free graph with n vertices contains at most (n/5)^5 cycles of length five, and this value is attained by the balanced blowup of the 5-cycle.

### Tutte Colloquium - Jim Geelen

Friday, November 8, 2019 — 3:30 PM EST

Title: Circuit-hyperplane relaxation and matroid representation

Speaker: Jim Geelen Affiliation: University of Waterloo Room: MC 5501

Abstract:

Relaxing a circuit-hyperplane in a representable matroid can destroy representability.

### Algebraic Combinatorics Seminar - Nick Early

Thursday, November 14, 2019 — 3:00 PM EST

Title: From weakly separated collections to matroid subdivisions

Speaker: Nick Early Affiliation: Perimeter Institute for Theoretical Physics Room: MC 5417

Abstract:

We study arrangements of slightly skewed tropical hyperplanes, called blades, on the vertices of a hypersimplex $\Delta_{k,n}$.

### Graphs and Matroids Seminar - Shayla Redlin

Thursday, November 14, 2019 — 4:00 PM EST

Title: Halfway to Rota's Basis Conjecture

Speaker: Shayla Redlin Affiliation: University of Waterloo Room: MC 5501

Abstract:

Rota’s Basis Conjecture is that any rank-n matroid with n disjoint bases B_1, …, B_n has n disjoint transversal bases; a basis is transversal if it contains exactly one element from each B_i.

### Combinatorial Optimization Reading Group - Benjamin Moore

Friday, November 15, 2019 — 1:00 PM EST

Title: A deterministic (1/2 + epsilon)-approximation for submodular maximizztion over a matroid

Speaker: Ben Moore Affiliation: University of Waterloo Room: MC 5417

Abstract:

In 1978, it was shown that a natural greedy algorithm gives a 1/2 approximation to submodular maximization subject to a matroid constraint.

### Tutte Colloquium - Marcel Golz

Friday, November 15, 2019 — 3:30 PM EST

Title: The combinatorics of parametric Feynman integrals

Speaker: Marcel Golz Affiliation: University of Waterloo Room: MC 5501

Abstract:

Feynman integrals are used in perturbative quantum field theory to compute the probabilities of processes involving elementary particles. They can be represented as Feynman graphs and exhibit a rich combinatorial structure. The parametric representation of Feynman integrals is particularly suitable to be studied from a combinatorial perspective since it contains well known objects like the Kirchhoff polynomial.

### PMATH/C&O Joint Colloquium - John Schanck

Thursday, November 21, 2019 — 4:00 PM EST

Title: Kummer's Theorem on binomial coefficients, etc.

Speaker: John Schanck Affiliation: University of Waterloo Room: MC 5501

Abstract:

Some of us like the primes and call ourselves pure mathematicians. Some of us like the Catalan numbers and call ourselves combinatorialists.

### Combinatorial Optimization Reading Group - Sharat Ibrahimpur

Friday, November 22, 2019 — 1:00 PM EST

Title: Submodular function maximization via the multilinear relaxation and contention resolution schemes

Speaker: Sharat Ibrahimpur Affiliation: University of Waterloo Room: MC 5417

Abstract:

I will present a general framework for maximizing a nonnegative submodular set function $f$ subject to a variety of packing type constraints including multiple matroid constraints, knapsack constraints, and their intersections.

### Tutte Colloquium - Aleksandr Kazachkov

Friday, November 22, 2019 — 3:30 PM EST

Title: Disjunctive Cuts through the V-Polyhedral Lens

Speaker: Aleksandr Kazachkov Affiliation: Polytechnique Montréal Room: MC 5501

Abstract:

Cutting planes, or cuts, are a critical component of modern integer programming solvers, but existing cuts implemented in solvers are relatively simple compared to those in the literature. We discuss the primary reasons for this disparity, as well as our recently-proposed V-polyhedral framework for mitigating some of these difficulties encountered by prior "stronger" cuts.

### November 2019

S M T W T F S
27
28
29
30
31
2
3
4
5
6
9
10
11
12
13
16
17
18
19
20
23
24
25
26
27
28
29
30
1. 2019 (160)
1. November (13)
2. October (18)
3. September (15)
4. August (9)
5. July (17)
6. June (18)
7. May (16)
8. April (9)
9. March (24)
10. February (13)
11. 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)