2000 character limit reached
On vanishing patterns in $j$-strands of edge ideals
Published 28 Oct 2015 in math.AC and math.CO | (1510.08192v2)
Abstract: We consider two problems regarding vanishing patterns in the Betti table of edge ideals $I$ in polynomial algebra $S$. First, we show that the $j$-strand is connected if $j=3$ (for $j=2$ this is easy and known), and give examples where the $j$-strand is not connected for any $j>3$. Next, we apply our result on strand connectivity to establish the subadditivity conjecture for edge ideals, $t_{a+b}\leq t_a+t_b$, in case $b=2,3$ (the case $b=1$ is known). Here $t_i$ stands for the maximal shifts in the minimal free $S$-resolution of $S/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.