Research

Papers

1. The GeometricDecomposability package for Macaulay2
   with Adam Van Tuyl
   Journal of Software for Algebra and Geometry 14(1): 41–50, 2024

   Abstract. Using the geometric vertex decomposition property first defined by Knutson, Miller, and Yong, a recursive definition for geometrically vertex decomposable ideals was given by Klein and Rajchgot. We introduce the Macaulay2 package GeometricDecomposability which provides a suite of tools to experiment and test the geometric vertex decomposability property of an ideal.

2. Gröbner geometry for regular nilpotent Hessenberg Schubert cells
   with Sergio Da Silva, Megumi Harada, and Jenna Rajchgot
   Journal of Pure and Applied Algebra 228(7), 2024

   Abstract. A regular nilpotent Hessenberg Schubert cell is the intersection of a regular nilpotent Hessenberg variety with a Schubert cell. In this paper, we describe a set of minimal generators of the defining ideal of a regular nilpotent Hessenberg Schubert cell in the type A setting. We show that these minimal generators are a Gröbner basis for an appropriate lexicographic monomial order. As a consequence, we obtain a new computational-algebraic proof, in type A, of Tymoczko’s result that regular nilpotent Hessenberg varieties are paved by affine spaces. In addition, we prove that these defining ideals are complete intersections, are geometrically vertex decomposable, and compute their Hilbert series. We also produce a Frobenius splitting of each Schubert cell that compatibly splits all of the regular nilpotent Hessenberg Schubert cells contained in it. This work builds on, and extends, work of the second and third author on defining ideals of intersections of regular nilpotent Hessenberg varieties with the (open) Schubert cell associated to the Bruhat-longest permutation.

3. Geometric vertex decomposition and liaison for toric ideals of graphs
   with Sergio Da Silva, Jenna Rajchgot, and Adam Van Tuyl
   Algebraic Combinatorics 6(4): 965–997, 2023
   

   Abstract. Geometric vertex decomposability for polynomial ideals is an ideal-theoretic generalization of vertex decomposability for simplicial complexes. Indeed, a homogeneous geometrically vertex decomposable ideal is radical and Cohen-Macaulay, and is in the Gorenstein liaison class of a complete intersection (glicci).

   In this paper, we initiate an investigation into when the toric ideal I_G of a finite simple graph G is geometrically vertex decomposable. We first show how geometric vertex decomposability behaves under tensor products, which allows us to restrict to connected graphs. We then describe a graph operation that preserves geometric vertex decomposability, thus allowing us to build many graphs whose corresponding toric ideals are geometrically vertex decomposable. Using work of Constantinescu and Gorla, we prove that toric ideals of bipartite graphs are geometrically vertex decomposable. We also propose a conjecture that all toric ideals of graphs with a square-free degeneration with respect to a lexicographic order are geometrically vertex decomposable. As evidence, we prove the conjecture in the case that the universal Gröbner basis of I_G is a set of quadratic binomials. We also prove that some other families of graphs have the property that I_G is glicci.

Software

1. GeometricDecomposability, a Macaulay2 package to check whether ideals are geometrically vertex decomposable, and related methods. Included in version 1.21 (and higher) of Macaulay2.
   With Adam Van Tuyl.
   For changes by version, see the changelog.

Thesis

1. Geometric Vertex Decomposition and Hessenberg Patch Ideals
   Undergraduate Thesis, McMaster University, 2022
   Supervisors: Sergio Da Silva, Megumi Harada, and Jenna Rajchgot

Many current and former members of McMaster's algebra group attended CAAC 2023 at the University of Waterloo.

Top row: Illya Kierkosz, Jenna Rajchgot, Kieran Bhaskara, myself, Adam Van Tuyl, Adrian Cook.
Bottom row: Thái Thành Nguyễn, Federico Galetto, Megumi Harada, Graham Keiper, Sergio Da Silva, Büşra Atar, Runyue Wang.

^*The underlying set is the collection of members. The group operation remains unclear.