When are Morse resolutions polyhedral?
Louis Bu, Sara Faridi, Iresha Madduwe Hewalage, Thiago Holleben, Hasan Mahmood, Dharm Veer, Kyle Wang, Scott Wesley

TL;DR
This paper investigates when Morse resolutions of monomial ideals are polyhedral, proving that ideals with up to four generators can have polyhedral Morse complexes, but larger ideals may not support such structures.
Contribution
It establishes conditions under which Morse complexes are polyhedral, showing that up to four generators allow polyhedral resolutions, while six generators can prevent this.
Findings
Morse complexes are polyhedral for monomial ideals with up to four generators.
Counterexample exists for six generators where no polyhedral Morse resolution is possible.
Some monomial ideals cannot have any polyhedral minimal free resolution.
Abstract
It is known that the chain complex of a simplex on vertices can be used to construct a free resolution of any ideal generated by monomials, and as a direct result, the Betti numbers always have binomial upper bounds, given by the number of faces of a simplex in each dimension. It is also known that for most monomials the resolution provided by the simplex is far from minimal. Discrete Morse theory provides an algorithm called \say{Morse matchings} by which faces of the simplex can be removed so that the chain complex on the remaining faces is still a free resolution of the same ideal. An immediate positive effect is an often considerable improvement on the bounds on Betti numbers. A caveat is the loss of the combinatorial structure of the simplex we started with: the output of the Morse matching process is a cell complex with no obvious structure besides an \say{address} for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
