Friday, November 6, 2026 3:30 pm
-
4:30 pm
EST (GMT -05:00)
| Speaker: | Adam Van Tuyl |
| Affiliation: | McMaster University |
| Location: | MC 5501 |
Abstract: Vertex decomposable simplicial complexes and geometrically vertex decomposable ideals have a lot of nice structure: they are shellable and Cohen–Macaulay, and the ideal version is also radical and glicci. There are many ways to attach an ideal to a graph, such as edge ideals, toric ideals, binomial edge ideals and star configurations, and the goal is to exploit the graph structure to decide whether the ideal is (geometrically) vertex decomposable. I will introduce these notions from scratch, with no commutative algebra assumed, and survey recent joint work, including a computer search of all graphs on 11 vertices and a conjecture for binomial edge ideals.