Papers
Topics
Authors
Recent
Search
2000 character limit reached

Green-Lazarsfeld Condition for Toric Edge Ideals of Bipartite Graphs

Published 7 Aug 2019 in math.AC and math.AG | (1908.02744v1)

Abstract: Previously, Ohsugi and Hibi gave a combinatorial description of bipartite graphs $G$ whose toric edge ideal $I_G$ is generated by quadrics, showing that every cycle of $G$ of length at least $6$ must have a chord. This corresponds to the Green-Lazarsfeld condition $\mathbf{N}_1$. In this paper, we investigate the higher syzygies of $I_G$ and give combinatorial descriptions of the Green-Lazarsfeld conditions $\mathbf{N}_p$ of toric edge ideals of bipartite graphs for all $p \ge 1$. In particular, we show that $I_G$ is linearly presented (i.e. satisfies condition $\mathbf{N}_2$) if and only if the bipartite complement of $G$ is a tree of diameter at most $3$. We also investigate the regularity of linearly presented toric edge ideals and give criteria for polyomino ideals to satisfy the Green-Lazarsfeld conditions.

Summary

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.

Collections

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