Abstract
In this paper, we prove the degree upper bound of projective subschemes in terms of the reduction number and show that the maximal cases are only arithmetically Cohen–Macaulay with linear resolutions. Furthermore, it can be shown that there are only two types of reduced, irreducible projective varieties with almost maximal degree. We also give the possible explicit Betti tables for almost maximal cases. In addition, interesting examples are provided to understand our main results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
