Quadratic linear strands of prime ideals
Giulio Caviglia, Alessandro De Stefani

TL;DR
This paper establishes optimal bounds on the quadratic generators of prime ideals in polynomial rings, showing they are limited by the ideal's height and providing examples achieving these bounds.
Contribution
It provides sharp, height-dependent bounds on the quadratic strand of prime ideals' resolutions, including existence of ideals attaining these bounds.
Findings
Prime ideals of height h have at most h^2 quadratic minimal generators.
Existence of prime ideals minimally generated by h^2 quadrics.
Bounds are optimal and depend only on the height of the prime ideal.
Abstract
We prove sharp estimates on the quadratic strand of the resolution of any homogeneous prime ideal in a standard graded polynomial ring over an arbitrary field. Our bounds only depend on the height of the prime ideal, and they are optimal since for every we show that there exists a prime ideal of height achieving them. In particular, we show that a prime ideal of height can contain at most quadratic minimal generators, and that there exists a prime ideal minimally generated by quadrics.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
