Parity Binomial Edge Ideals with Pure Resolutions
Commutative Algebra
2020-11-17 v1
Abstract
We provide a characterisation of all graphs whose parity binomial edge ideals have pure resolutions. In particular, we show that the minimal free resolution of a parity binomial edge ideal is pure if and only if the corresponding graph is a complete bipartite graph, or a disjoint union of paths and odd cycles.
Cite
@article{arxiv.2011.07983,
title = {Parity Binomial Edge Ideals with Pure Resolutions},
author = {Peter Phelan},
journal= {arXiv preprint arXiv:2011.07983},
year = {2020}
}
Comments
13 pages, 6 figures