LEAPS-MPS: Interactions Between Algebraic Combinatorics, Groebner Geometry and Liaison Theory

There are many real-world problems that can be modeled using mathematics which involve a combinatorial description in terms of a graph or polytope. The field of algebraic combinatorics lies in the intersection of geometry, algebra and combinatorics, and involves questions where complicated systems can be reduced to simple discrete data that is easier to visualize and compute with. It has played an increasingly important role in modern mathematics, having interactions with applied fields like statistics, network optimization, particle physics, and cryptography. For example, vehicle routing and communication networks can be represented by a graph, and properties of these systems can be translated into graph-theoretic properties and algorithms (like connectivity, shortest distance algorithms, or weighted scheduling algorithms). Algebraic objects known as Grobner bases play an essential role in computational questions arising in algebraic geometry, and degeneration techniques like geometric vertex decomposition have proven to be extremely useful in a broad range of settings. This project will advance the use of these techniques to answer open questions in algebra, geometry, and combinatorics. This award will also support outreach to local high schools, provide research opportunities for undergraduate and graduate students, encourage interdisciplinary and international research, and will provide exposure of STEM research to the local community.

More precisely, the project will advance the use of tools like Groebner degeneration, geometric vertex decomposition, and Frobenius splitting to answer various open questions about subword complexes, edge ideals, toric ideals of graphs, Gorenstein linkage, and Schubert varieties. For instance, when is the toric ideal of a graph Cohen-Macaulay? One approach is to use geometric vertex decomposability and its variations (which all imply the Cohen-Macaulay property in this setting), together with certain iterative graph operations that preserve decomposability (such as star contractions and cycle gluing) to classify such graphs. Another subproject involves characterizing the Gorenstein locus of a Schubert variety in a flag variety by translating a previously studied subword complex description of the Gorenstein property into an interval pattern avoidance condition. An extension of this approach will be used to partially characterize Gorenstein edge ideals and will serve as a testing ground for understanding the boundaries of what is possible with this technique.

This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

Award Number: 2532757
Principal Investigator: Sergio Da Silva
Funds Obligated: $248,904
State: VA