Seminars and Colloquia by Series

A Taste of Extremal Combinatorics in AG

Series
Algebra Seminar
Time
Tuesday, December 7, 2021 - 10:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Robert WalkerUniversity of Wisconsin, Madison

In this talk, we survey known results and open problems tied to the dual graph of a projective algebraic F-scheme over a field F, a construction that apparently Janos Kollar is familiar with. In particular one can use this construction to answer the following question: if you consider the 27 lines on a cubic surface in P^3, how many lines meet a given line? The dual graph can answer this and more questions in enumerative geometry and intersection theory easily, based on work of Benedetti -- Varbaro and others.

TBA

Series
Algebra Student Seminar
Time
Friday, December 3, 2021 - 10:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Tianyi ZhangGeorgia Tech

Constructions in combinatorics via neural networks

Series
Graph Theory Seminar
Time
Tuesday, November 30, 2021 - 11:00 for 1 hour (actually 50 minutes)
Location
ONLINE
Speaker
Adam Zsolt WagnerTel Aviv University

Please Note: Note the unusual time!

Recently, significant progress has been made in the area of machine learning algorithms, and they have quickly become some of the most exciting tools in a scientist’s toolbox. In particular, recent advances in the field of reinforcement learning have led computers to reach superhuman level play in Atari games and Go, purely through self-play. In this talk I will give a basic introduction to neural networks and reinforcement learning algorithms. I will also indicate how these methods can be adapted to the "game" of trying to find a counterexample to a mathematical conjecture, and show some examples where this approach was successful.

TBA

Series
Algebra Seminar
Time
Tuesday, November 30, 2021 - 10:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Brooke UlleryEmory University

Strong 4-colourings of graphs

Series
Graph Theory Seminar
Time
Tuesday, November 23, 2021 - 15:45 for 1 hour (actually 50 minutes)
Location
ONLINE
Speaker
Jessica McDonaldAuburn University

In this talk we’ll discuss strong 4-colourings of graphs and prove two new cases of the Strong Colouring Conjecture. Let H be a graph with maximum degree at most 2, and let G be obtained from H by gluing in vertex-disjoint copies of K_4. We’ll show that if H contains at most one odd cycle of length exceeding 3, or if H contains at most 3 triangles, then G is 4-colourable. This is joint work with Greg Puleo.

Pages