Upper bounds for graded betti numbers of projective schemes in the first nontrivial strand
Doyoon Ha, Minjae Kwon, JeongDon Lee, Jinhyung Park

TL;DR
This paper employs Boij-S"{o}derberg theory to provide a new, streamlined approach to establishing upper bounds for graded Betti numbers of projective schemes, focusing on the first nontrivial strand.
Contribution
It introduces a novel method leveraging Boij-S"{o}derberg theory to simplify and improve bounds on graded Betti numbers for projective schemes.
Findings
Derived new upper bounds for graded Betti numbers
Simplified existing proofs using Boij-S"{o}derberg theory
Focused on the first nontrivial strand of Betti tables
Abstract
Using Boij-S\"{o}derberg theory, we give a quick new approach to the results of Han-Kwak and Ahn-Han-Kwak on upper bounds for graded betti numbers of projective schemes in the first nontrivial strand.
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.
Taxonomy
TopicsCommutative Algebra and Its Applications · Tensor decomposition and applications · Coding theory and cryptography
