Please email any errors or updates to our website support/editor.
PDF files require Adobe Acrobat Reader.
Sun  Mon  Tue  Wed  Thu  Fri  Sat 

24

25

26

27

28

2









3

4

9






10

11

16






17

18

23






24

25

30






31

1

2

3

4

5

6








Title: Fixedparameter tractability with respect to treewidt
Speaker: Rose McCarty Affiliation: University of Waterloo Room: MC 5479Abstract: Courcelle’s Theorem says that a very general class of decision problems on graphs is FPT with
Title: MAD and Local Versions of Reed's Conjecture
Speaker: Luke Postle Affiliation: University of Waterloo Room: MC 5501Abstract:
Graph coloring is a widely studied area of graph theory dating from the time of the Four Color Conjecture (now theorem).
Title: Entropy and the Upper Matching Conjecture
Abstract: In this talk we examine the 2013 work of Ilinca and Kahn,
Title: Free subshifts and the Local Lemma
Speaker: Anton Bernshteyn Affiliation: Carnegie Mellon University Room: MC 5501Abstract: The purpose of this talk is to demonstrate how combinatorial tools and techniques can be used to tackle problems in other areas of mathematics, specifically,
Title: Introduction to highdimensional probability: some basic concentration inequalities and useful distributions
Speaker: Courtney Paquette Affiliation: University of Waterloo Room: MC 5417Abstract: In this seminar, we introduce important tools from highdimensional probability useful in studying applications in data science such as covariance estimation, matrix completion,
Title: On the Hardness of 4coloring a 3colorable graph
Speaker: Akshay Ramachandran Affiliation: University of Waterloo Room: MC 5479Abstract: A consequence of the PCP theorem is that it is NPhard to approximate the chromatic number of a general graph to within \n^{1\eps} for any constant epsilon.
Title: From graph theory to set theory and back
Speaker: Anton Bernshteyn Affiliation: Carnegie Mellon University Room: MC 5501Abstract:
Many results in finite combinatorics can be extended to infinite structures via compactnessbut this transfer is powered by the Axiom of Choice and leads, in general, to highly "pathological" objects.
Title: Counting maximal independent sets in the hypercube
Speaker: Richard Lang Affiliation: University of Waterloo Room: MC 6486Abstract:
In this talk we count the number of maximal independent set in the hypercube. It is not hard to see that the ndimensional hypercube contains at least 2(n2) maximal independent sets.
Title: Ideal clutters and kwise intersecting families
Speaker: Ahmad Abdi Affiliation: Carnegie Mellon University Room: MC 5501Abstract:
A clutter is *ideal* if the corresponding set covering polyhedron has no fractional vertices, and it is *kwise intersecting* if the members don’t have a common element but every k members do.
Title: Highdimensional probability: Random vectors in high dimensions
Speaker: Courtney Paquette Affiliation: University of Waterloo Room: MC 5417Abstract:
In this talk, I will finish our discussion of concentration inequalities, particularly, I will discuss the subexponential distribution and state Bernstein’s inequality; thereby completing our study of large deviations.
Title: Approximate Coloring of 2Colorable 4Uniform Hypergraphs
Speaker: Joshua Nevin Affiliation: University of Waterloo Room: MC 5479Abstract:
In this talk, we discuss several inapproximability results of Bhangale for 2colorable 4uniform hypergraphs.
Title: Ideal matrices
Speaker: Ahmad Abdi Affiliation: Carnegie Mellon University Room: MC 5501Abstract:
A 0,1 matrix M is *ideal* if the set covering system Mx>=1, x>=0 gives an integral polyhedron.
Title: Hypergraphs, Entropy, and Inequalities
Speaker: Alessandra Graf Affiliation: University of Waterloo Room: MC 6486Abstract:
In this talk, we discuss a generalization of Shearer's entropy lemma for weighted hypergraphs due to Friedgut (2004).
Title: The Iterated Local Model for Social Networks
Speaker: Erin Meger Affiliation: Ryerson University Room: MC 5501Abstract:
Online social networks such as Facebook and Twitter are often studied through friendships between users. Adversarial relationships also play an important role in the structure of these social networks.
Title: Is any knot not the unknot?
Speaker: Patrick Naylor Affiliation: University of Waterloo Room: MC 4064Abstract:
Ever wanted to learn something about knots? This is your chance! We'll talk about some basics of knot theory, including how to prove some intuitively `obvious' but mathematically tricky results.
Title: Highdimensional probability: Random vectors in high dimensions
Speaker: Courtney Paquette Affiliation: University of Waterloo Room: MC 5417Abstract:
In this talk, I will finish our discussion of concentration inequalities, particularly, I will discuss the subexponential distribution and state Bernstein’s inequality; thereby completing our study of large deviations.
Title: Introduction to Quantum Cocliques
Speaker: Mariia Sobchuk Affiliation: University of Waterloo Room: MC 6486Abstract:
Quantum coclique is a generalisation of the notion of classical coclique.
Title: Optimization in Data Analysis: Some Recent Developments
Speaker: Stephen J. Wright Affiliation:Computer Sciences Department and Wisconsin Institute for Discovery
University of WisconsinMadison
Room: MC 5501Abstract:
Optimization is vital to the modern revolution in data science, and techniques from optimization have become essential in formulating and solving a wide variety of data analysis problems. In turn, data science has caused a ferment of new research activity in optimization by posing challenging new problems and new contexts.
Title: On the average size of independent sets in trianglefree graphs
Speaker: John Schanck Affiliation: University of Waterloo Room: MC 6486Abstract:
Some of the results that we've seen in this reading group have been improved recently using the "hardcore model" from statistical physics.
Title: Decomposing graphs into rooted odd trails
Speaker: Rose McCarty Affiliation: University of Waterloo Room: MC 5501Abstract:
We give a precise characterization of when the edge set of a graph can be partitioned into k trails so that every trail begins and ends at a specified vertex v and has an odd number of edges.
Joint work with Jim Geelen and Paul Wollan.
Title: Not colouring the 3sphere
Speaker: Chris Godsil Affiliation: Unioversity of Waterloo Room: MC 6486Abstract:
Let S(3) be the graph formed by the unit vectors in R3, two vectors adjacent if they are orthogonal. I will prove that S(3) has no 3colouring.
Title: Highdimensional probability: Bernstein's Inequality
Speaker: Jimit Majmudar Affiliation: University of waterloo Room: MC 5417Abstract:
We will extend our study of concentration inequalities so far to random matrices.
Title: Using Lasserre Hierarchy for Graph Coloring
Speaker: Julian Romero Barbosa Affiliation: University of Waterloo Room: MC 5479Abstract:
In this talk, I will go over a technique introduced by Arora and Ge for coloring 3colorable graphs having low threshold rank (i.e., graphs with few eigenvalues below certain negative constant).
Title: Toward a Theory of CrossingCritical Graphs
Speaker: Bojan Mohar Affiliation: Simon Fraser University Room: MC 5501Abstract:
The crossing number of a graph is defined as the minimum number of crossings of edges in a drawing of the graph in the plane. In his seminal 1970 paper Toward a Theory of Crossing Numbers, Tutte made a fundamental contribution by proving what is known today as the HananiTutte Theorem.
Please email any errors or updates to our website support/editor.
PDF files require Adobe Acrobat Reader.