Table of Contents
Fetching ...

(Almost) Complete Intersection Lovász-Saks-Schrijver ideals and regularity of their powers

Marie Amalore Nambi, Neeraj Kumar, Chitra Venugopal

TL;DR

We study when Lovász–Saks–Schrijver (LSS) ideals and twisted LSS-ideals associated with graphs are (almost) complete intersections and how these properties control the regularity of their powers. A key tool is the twisted positive matching decomposition $\mathrm{tpmd}(G)$; we prove that $d \ge \mathrm{tpmd}(G)$ implies $\hat{L}_G(d)$ is a radical complete intersection, with connections to determinantal and Pfaffian ideals for unicyclic and bicyclic graphs. We characterize almost complete intersection LSS-ideals for trees and $C_3$-free unicyclic/bicyclic graphs, including explicit constructions and height calculations, and provide exact formulas and bounds for the regularity of powers in trees and unicyclic graphs with $\Delta(G) \le d$, along with Koszulness criteria for quotients $S/L_G(d)$. These results translate combinatorial graph invariants into precise algebraic properties, yielding concrete criteria and bounds for the ideals and their powers across several graph families.

Abstract

We discuss the property of (almost) complete intersection of LSS-ideals of graphs of some special forms, like trees, unicyclic, and bicyclic graphs. Further, we give a sufficient condition for the complete intersection property of twisted LSS-ideals in terms of a new graph theoretical invariant called twisted positive matching decomposition number denoted by tpmd. We also study the regularity of powers of LSS-ideals and make observations related to the Koszul property of the quotients of the same.

(Almost) Complete Intersection Lovász-Saks-Schrijver ideals and regularity of their powers

TL;DR

We study when Lovász–Saks–Schrijver (LSS) ideals and twisted LSS-ideals associated with graphs are (almost) complete intersections and how these properties control the regularity of their powers. A key tool is the twisted positive matching decomposition ; we prove that implies is a radical complete intersection, with connections to determinantal and Pfaffian ideals for unicyclic and bicyclic graphs. We characterize almost complete intersection LSS-ideals for trees and -free unicyclic/bicyclic graphs, including explicit constructions and height calculations, and provide exact formulas and bounds for the regularity of powers in trees and unicyclic graphs with , along with Koszulness criteria for quotients . These results translate combinatorial graph invariants into precise algebraic properties, yielding concrete criteria and bounds for the ideals and their powers across several graph families.

Abstract

We discuss the property of (almost) complete intersection of LSS-ideals of graphs of some special forms, like trees, unicyclic, and bicyclic graphs. Further, we give a sufficient condition for the complete intersection property of twisted LSS-ideals in terms of a new graph theoretical invariant called twisted positive matching decomposition number denoted by tpmd. We also study the regularity of powers of LSS-ideals and make observations related to the Koszul property of the quotients of the same.
Paper Structure (4 sections, 21 theorems, 27 equations, 4 figures)

This paper contains 4 sections, 21 theorems, 27 equations, 4 figures.

Key Result

Theorem 1

Let $G$ be a graph and $d$ be a positive integer.

Figures (4)

  • Figure 1: The graph $G$
  • Figure 2: The graphs $H_1$ and $H_2$
  • Figure 3: The weight functions for the graphs $H_1$ and $H_2$
  • Figure :

Theorems & Definitions (67)

  • Theorem 1
  • Remark 1.1
  • Remark 1.2
  • Definition 1.3
  • Definition 1.4
  • Definition 1.5
  • Remark 1.6
  • Remark 1.7
  • Remark 1.8
  • Remark 1.9
  • ...and 57 more