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

26

27

28

29

30

31

1








2

3

4

5

7

8









9

10

11

12

15








16

17

18

19

21

22









23

24

25

26

29







Title: Minimum degree conditions for Hamilton cycles in hypergrahs
Speaker: Richard Lang Affiliation: University of Waterloo Room: MC 5479Abstract:
A classic result of Dirac states that a graph in which every vertex is connected to at least half of the other vertices contains a Hamilton cycle. How can we generalize Dirac's theorem to hypergraphs?
Title: Moore Graphs
Speaker: Chris Godsil Affiliation: University of Waterloo Room: MC 5417Abstract:
Moore graphs were introduced by Hoffman and Singleton in a fundamental paper. They can be defined as graphs with diameter $d$ and girth $2d+1$.
Title: A generalization of balanced tableaux and matching problems with unique solutions
Speaker: Brian Chan Affiliation: University of British Columbia Room: MC 5417Abstract:
In this talk, we consider families of finite sets that we call shellable and that have been characterized by Chang and Hirst and Hughes as being the families of sets that admit unique solutions to Hall's matching problem.
Title: List Colouring and Ohba's Conjecture
Speaker: Matt Kroeker Affiliation: University of Waterloo Room: MC 5479Abstract:
The question of when the listchromatic number of a graph G, denoted chi_l(G), equals its chromatic number is fundamental to the theory of list colouring.
Title: The Aggregation Closure is Polyhedral for Packing and Covering Integer Programs
Speaker: Kanstantsin Pashkovich Affiliation: University of Ottawa Room: MC 5417Abstract:
Recently, Bodur, Del Pia, Dey, Molinaro and Pokutta introduced the concept of aggregation cuts for packing and covering integer programs.
Title: Trianglefree Strongly Regular Graphs
Speaker: Chris Godsil Affiliation: University of Waterloo Room: MC 5417Abstract:
Complete bipartite graphs aside, only five trianglefree strongly regular graphs are known. I will describe some of the background to this topic, with the focus on outlining the construction of the HigmanSims graph.
Title: Linear Programming and Extremal Expanders
Speaker: Sabrina Lato Affiliation: University of Waterloo Room: MC 5417Abstract:
Nozaki proved a linear programming bound on the number of vertices that depends on the eigenvalues of a graph.
Title: An equivariant basis for the cohomology of Springer fibers
Speaker: Ed Richmond Affiliation: Oklahoma State University Room: MC 5417Abstract:
Springer fibers are subvarieties of the flag variety that play an important role in combinatorics and geometric representation theory. In this talk, I will discuss joint work with Martha Precup where we analyze the equivariant cohomology of Springer fibers in type A.
Title: Excluding an asymmetric group labelled graph
Speaker: Farbod Yadegarian Affiliation: University of Waterloo Room: MC 5479Abstract:
There are several models of group labelled graphs. In the simpler, undirected model, for an abelian group Γ, every edge e receives a label γ(e) in Γ.
Title: An Introduction to the Circuits of Polyhedra, The Circuit Diameter, and Their Applications
Speaker: Sean Kafer Affiliation: University of Waterloo Room: MC 5417Abstract:
The combinatorial diameter of a polyhedron P is the maximum value of a shortest path between two vertices of P, where the path moves along edges of P. Its study is motivated largely by its implications on the running time of the Simplex algorithm.
Title: Parallel strategies for SIDH: towards computing SIDH twice as fast
Speaker: Francisco RodríguezHenríquez Affiliation: CINVESTAVIPN Room: MC 5501Abstrtact:
Over the last ten years, there has been an intense research effort to find hard mathematical problems that would be presumably hard to solve by a quantum attacker and at the same time could be used to build reasonably efficient publickey cryptoschemes.
Please email any errors or updates to our website support/editor.
PDF files require Adobe Acrobat Reader.