Papers
Topics
Authors
Recent
Search
2000 character limit reached

Regularity of Edge Ideals Via Suspension

Published 8 Aug 2019 in math.AC and math.CO | (1908.03115v2)

Abstract: We study the Castelnuovo-Mumford regularity of powers of edge ideals. We prove that if G is a bipartite graph, then reg(I(G)s) \leq 2s + reg I(G) - 2 for all s \geq 2, which is the best possible upper bound for any s. Suspension plays a key role in proof of the base case s =2.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.