Title: Ideal matrices
| Speaker: | Ahmad Abdi |
| Affiliation: | Carnegie Mellon University |
| Room: | MC 5501 |
Abstract:
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 6486 |
Abstract:
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 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.
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.
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.
Title: Introduction to Quantum Cocliques
| Speaker: | Mariia Sobchuk |
| Affiliation: | University of Waterloo |
| Room: | MC 6486 |
Abstract:
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 Wisconsin-Madison |
| Room: | MC 5501 |
Abstract:
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 triangle-free graphs
| Speaker: | John Schanck |
| Affiliation: | University of Waterloo |
| Room: | MC 6486 |
Abstract:
Some of the results that we've seen in this reading group have been improved recently using the "hard-core model" from statistical physics.
Title: Decomposing graphs into rooted odd trails
| Speaker: | Rose McCarty |
| Affiliation: | University of Waterloo |
| Room: | MC 5501 |
Abstract:
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 3-sphere
| Speaker: | Chris Godsil |
| Affiliation: | Unioversity of Waterloo |
| Room: | MC 6486 |
Abstract:
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 3-colouring.