Recursive strategy for decomposing Betti tables of complete intersections

Authors

Courtney R. Gibbons, Hamilton CollegeFollow
Robert Huben
Branden Stone

Type of Work

Article

Date

8-17-2017

Abstract

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. We also provide a detailed analysis of the Boij-Soederberg decomposition for Betti diagrams of codimension four complete intersections where the largest generating degree satisfies the size condition.

Citation Information

Gibbons, Courtney R.; Huben, Robert; and Stone, Branden, "Recursive strategy for decomposing Betti tables of complete intersections" (2017). Hamilton Digital Commons.
https://digitalcommons.hamilton.edu/articles/275

Notes

This page links to a version of the paper posted at arXiv.org on August 17, 2017.

Hamilton Areas of Study

Mathematics