Please email any errors or updates to our website support/editor.
PDF files require Adobe Acrobat Reader.
Thursday, June 20, 2019 — 3:30 PM EDT
Title: Arborified zeta values and shuffles of rooted trees
| Speaker: | Pierre Clavier |
| Affiliation: | Potsdam University |
| Room: | MC 6483* |
*Please note room change
Abstract:
Arborified zeta values are a generalisation to rooted trees of the usual multizeta values.
Thursday, June 20, 2019 — 4:00 PM EDT
Title: The Parallel Postulate: a 2000-year controversy
| Speaker: | Eric Thomas Boulter |
| Affiliation: | University of Waterloo |
| Room: | MC 5501 |
Abstract:
Euclid's book The Elements was groundbreaking in its logical formulation of synthetic geometry, and it is profoundly influential to this day, as it is widely considered to be the most published non-religious book in human history.
Friday, June 21, 2019 — 1:00 PM EDT
Title: Maximum Cardinality Popular Matchings
| Speaker: | Ishan Bansal |
| Affiliation: | University of Waterloo |
| Room: | MC 5479 |
Abstract:
We have seen the algorithm by Abraham, Irving, Kavitha, and Mehlhorn which deals with finding popular matchings (can be easily modified to give maximum cardinality popular matchings) in bipartite graphs with one-sided preference lists.
Friday, June 21, 2019 — 3:30 PM EDT
Title: Finding perfect matchings in random regular graphs in linear expected time
| Speaker: | Michael Anastos |
| Affiliation: | Carnegie Mellon University |
| Room: | MC 5501 |
Abstract:
In a seminal paper on finding large matchings in sparse random graphs, Karp and Sipser proposed two algorithms for this task. The second algorithm has been intensely studied, but due to technical difficulties, the first algorithm has received less attention. Empirical results suggest that the first algorithm is superior.