Syzygies and parking functions from hypergraph polytopes
- Series
- Algebra Seminar
- Time
- Monday, November 18, 2024 - 11:30 for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Anton Dochtermann – Texas State University
Please Note: There will be a pre-seminar at 10:55 am in Skiles 005.
For a connected graph G, the set of G-parking functions are integer sequences counted by spanning trees that arise in the theory of chip-firing on G. They can also be defined as the standard monomials of a `G-parking function ideal', whose homological properties have interesting combinatorial interpretations. We extend these constructions to the setting of hypergraphs, where edges can have multiple vertices. We study algebraic and combinatorial aspects of parking functions in this context, employing generalized notions of acyclic orientations and spanning trees. Minimal cellular resolutions of the underlying ideals can be understood in terms of certain generalized permutohedra. This is joint work with Ayah Almousa and Ben Smith, as well as an REU project with Timothy Blanton, Isabelle Hong, Suho Oh, and Zhan Zhan.