Abstract

In this article, we obtain an upper bound for the Castelnuovo-Mumford regularity of powers of an ideal generated by a homogeneous quadratic sequence in a polynomial ring in terms of the regularity of its related ideals and degrees of its generators. As a consequence, we compute upper bounds for the regularity of powers of several binomial ideals. We generalize a result of Matsuda and Murai to show that the regularity of JGs is bounded below by 2s+ℓ(G)−1 for all s≥1, where JG denotes the binomial edge ideal of a graph G and ℓ(G) is the length of a longest induced path in G. We compute the regularity of powers of binomial edge ideals of cycle graphs, star graphs, and balloon graphs explicitly. Also, we give sharp bounds for the regularity of powers of almost complete intersection binomial edge ideals and parity binomial edge ideals.

Full Text
Published version (Free)

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 call