The reduction number and degree bound of projective subschemes

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.