English

Ideals of submaximal minors of sparse symmetric matrices

Commutative Algebra 2022-11-15 v1 Algebraic Geometry Combinatorics

Abstract

We study algebraic and homological properties of the ideal of submaximal minors of a sparse generic symmetric matrix. This ideal is generated by all (n1)(n-1)-minors of a symmetric n×nn \times n matrix whose entries in the upper triangle are distinct variables or zeros and the zeros are only allowed at off-diagonal places. The surviving off-diagonal entries are encoded as a simple graph GG with nn vertices. We prove that the minimal free resolution of this ideal is obtained from the case without any zeros via a simple pruning procedure, extending methods of Boocher. This allows us to compute all graded Betti numbers in terms of nn and a single invariant of GG. Moreover, it turns out that these ideals are always radical and have Cohen--Macaulay quotients if and only if GG is either connected or has no edges at all. The key input are some new Gr\"obner basis results with respect to non-diagonal term orders associated to GG.

Keywords

Cite

@article{arxiv.2211.07020,
  title  = {Ideals of submaximal minors of sparse symmetric matrices},
  author = {Jiahe Deng and Andreas Kretschmer},
  journal= {arXiv preprint arXiv:2211.07020},
  year   = {2022}
}

Comments

14 pages, comments welcome!