2000 character limit reached
The Principal Component of the Jets of a Graph
Published 11 Jan 2022 in math.AC, math.AG, and math.CO | (2201.04164v1)
Abstract: We define the s-order principal component of the jets of a graph and give a description of the primary decomposition of its edge ideal in terms of the minimal vertex covers of the base graph. As an application, we show the s-order principal component of the jets of a cochordal graph is cochordal, and connect this to Froberg's theorem on the linear resolution of edge ideals of cochordal graphs. An appendix is provided describing some computations of jets in the computer algebra system Macaulay2.
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.