Bounds for Arithmetic Degrees

ABSTRACT

Let I be a monomial ideal with minimal monomial generators m₁,…, m_s, and assume that deg(m₁) ≥deg(m₂) ≥ … ≥deg(m_s). Among other things, we prove that the arithmetic degree of I is bounded above by deg(m₁)…deg(m_mht(I)), where mht(I) is the maximal height of associated primes of I. This bound is shaper than the one given in 12 Sturmfels, B., Trung, N. V., Vogel, W. (1995). Bounds on degrees of projective schemes. Math. Ann. 302:417–432.Crossref], Web of Science ®] , Google Scholar]] and more natural than the one given in 9 Hoa, L. T., Trung, N. V. (1998). On the Castelnuovo-Mumford regularity and the arithmetic degree of monomial ideals. Math. Z. 229:519–537.Crossref], Web of Science ®] , Google Scholar]]. In addition, we point out that adeg(I) ≠ adeg(Gin(I)) in general and conjecture that adeg(I) = adeg(Gin(I)) if and only if R/I is sequentially Cohen–Macaulay.