2000 character limit reached
Large lower bounds for the betti numbers of graded modules with low regularity
Published 29 Mar 2019 in math.AC and math.AG | (1903.12503v2)
Abstract: Suppose that $M$ is a finitely-generated graded module of codimension $c\geq 3$ over a polynomial ring and that the regularity of $M$ is at most $2a-2$ where $a\geq 2$ is the minimal degree of a first syzygy of $M$. Then we show that the sum of the betti numbers of $M$ is at least $\beta_0(M)(2c + 2{c-1})$. In addition, if $c \geq 9$ then for each $1\leq i\leq \lceil c/2\rceil$, we show $\beta_i(M)\geq 2\beta_0(M){c \choose i}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.