Events

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Friday, March 8, 2019 1:00 pm - 1:00 pm EST (GMT -05:00)

Combinatorial Optimization Reading Group- Akshay Ramachandran

Title: On the Hardness of 4-coloring a 3-colorable graph

Speaker: Akshay Ramachandran
Affiliation: University of Waterloo
Room: MC 5479

Abstract: A consequence of the PCP theorem is that it is NP-hard to approximate the chromatic number of a general graph to within \n^{1-\eps} for any constant epsilon.

Friday, March 8, 2019 3:30 pm - 3:30 pm EST (GMT -05:00)

Tutte Colloquium - Anton Bernshteyn

Title: From graph theory to set theory and back

Speaker: Anton Bernshteyn
Affiliation: Carnegie Mellon University
Room: MC 5501

Abstract:

Many results in finite combinatorics can be extended to infinite structures via compactness---but this transfer is powered by the Axiom of Choice and leads, in general, to highly "pathological" objects.

Tuesday, March 12, 2019 2:00 pm - 2:00 pm EDT (GMT -04:00)

Reading Group on Entropy and Counting - Richard Lang

Title: Counting maximal independent sets in the hypercube

Speaker: Richard Lang
Affiliation: University of Waterloo
Room: MC 6486

Abstract:

In this talk we count the number of maximal independent set in the hypercube. It is not hard to see that the n-dimensional hypercube contains at least 2(n-2) maximal independent sets.

Wednesday, March 13, 2019 3:30 pm - 3:30 pm EDT (GMT -04:00)

Graphs and Matroids - Ahmad Abdi

Title: Ideal clutters and k-wise intersecting families

Speaker: Ahmad Abdi
Affiliation: Carnegie Mellon University
Room: MC 5501

Abstract:

A clutter is *ideal* if the corresponding set covering polyhedron has no fractional vertices, and it is *k-wise intersecting* if the members don’t have a common element but every k members do. 

Thursday, March 14, 2019 4:00 pm - 4:00 pm EDT (GMT -04:00)

Continuous Optimization Seminar - Courtney Paquette

Title: High-dimensional probability: Random vectors in high dimensions

Speaker: Courtney Paquette
Affiliation: University of Waterloo
Room: MC 5417

Abstract:

In this talk, I will finish our discussion of concentration inequalities, particularly, I will discuss the sub-exponential distribution and state Bernstein’s inequality; thereby completing our study of large deviations.

Friday, March 15, 2019 1:00 pm - 1:00 pm EDT (GMT -04:00)

Combinatorial Optimization Reading Group - Joshua Nevin

Title: Approximate Coloring of 2-Colorable 4-Uniform Hypergraphs

Speaker: Joshua Nevin
Affiliation: University of Waterloo
Room: MC 5479

Abstract:

In this talk, we discuss several inapproximability results of Bhangale for 2-colorable 4-uniform hypergraphs.

Tuesday, March 19, 2019 2:00 pm - 2:00 pm EDT (GMT -04:00)

Reading group on Entropy and Counting - Alessandra Graf

Title: Hypergraphs, Entropy, and Inequalities

Speaker: Alessandra Graf
Affiliation: University of Waterloo
Room: MC 6486

Abstract:

In this talk, we discuss a generalization of Shearer's entropy lemma for weighted hypergraphs due to Friedgut (2004).

Wednesday, March 20, 2019 3:30 pm - 3:30 pm EDT (GMT -04:00)

Graphs and Matroids - Erin Meger

Title: The Iterated Local Model for Social Networks

Speaker: Erin Meger
Affiliation: Ryerson University
Room: MC 5501

Abstract:

On-line 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.

Wednesday, March 20, 2019 4:30 pm - 4:30 pm EDT (GMT -04:00)

C&O/PMATH Joint Colloquium - Patrick Naylor (RE-SCHEDULED)

Title: Is any knot not the unknot?

Speaker: Patrick Naylor
Affiliation: University of Waterloo
Room: MC 4064

Abstract:

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.