Recursive Decompositions of Betti diagrams of complete intersections


In this talk we introduce a recursive decomposition algorithm for the Betti diagram of a complete intersection using the diagram of a complete intersection defined by a subset of the original generators. This alternative algorithm is the main tool that we use to investigate stability and compatibility of the Boij-Soederberg decompositions of related diagrams; indeed, when the biggest generating degree is sufficiently large, the alternative algorithm produces the Boij-Soederberg decomposition.

Jun 21, 2018 12:00 AM
Syracuse University
Courtney R. Gibbons
Courtney R. Gibbons
Associate Professor of Mathematics

Math Professor at Hamilton College since 2013