arXiv · 2112.08864
Matrix factorizations of generic polynomials
Abstract
We prove that the Buchweitz-Greuel-Schreyer Conjecture on the minimal rank of a matrix factorization holds for a generic polynomial of given degree and strength. The proof introduces a notion of the secondary strength of a polynomial, and uses a variant of the ultraproduct technique of Erman, Sam, and Snowden.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Daniel Erman. 2022-09-26. Matrix factorizations of generic polynomials. https://arxiv.org/abs/2112.08864
Cite the original work for its findings. Save a collection to share your selection of sources.