Lovász–Saks–Schrijver Ideal

• The LSS ideal is a quadratic ideal that encodes orthogonal vector assignments to graph vertices, reflecting the graph's structure via polynomial equations.
• It links algebraic properties such as primality, complete intersection, and radicality with combinatorial invariants like positive matching decomposition, providing explicit thresholds for various graph types.
• The construction extends naturally to hypergraphs and twisted cases, unifying the study of determinantal varieties, tensor sections, and orthogonal representations.

The Lovász–Saks–Schrijver (LSS) ideal is a quadratic ideal associated to graphs and hypergraphs, central in the algebraic study of orthogonal representations, determinantal varieties, and tensor sections. For a fixed graph $G$ and integer $d \geq 1$, the LSS-ideal encodes the conditions for assigning $d$-vectors to vertices such that orthogonality constraints are fulfilled for specified pairs, directly reflecting graph-theoretic structure in polynomial equations. These ideals exhibit profound connections to combinatorial invariants, symmetric determinantal ideals, and paving matroids, and have been the focus of extensive research investigating their algebraic properties, primary decomposition, and geometric meaning.

1. Precise Definition

Let $G = ([n], E)$ be a finite simple graph and $d \geq 1$. In the polynomial ring

$$S = K[x_{i1}, x_{i2}, \ldots, x_{id} \mid i=1, \ldots, n],$$

define, for each unordered pair $\{i, j\}$,

$f_{ij} = \sum_{k=1}^d x_{ik} x_{jk} \in S.$

The $d$-dimensional Lovász–Saks–Schrijver ideal of $G$ is

$d \geq 1$0

i.e., it is generated by quadratic forms for edges of the complement graph $d \geq 1$1 (Conca et al., 2018). For hypergraphs, the construction generalizes with $d \geq 1$2 for each edge $d \geq 1$3 (Gharakhloo et al., 2022). The quotient ring $d \geq 1$4 parametrizes orthogonal representations of $d \geq 1$5: assigning $d \geq 1$6 to vertex $d \geq 1$7 such that $d \geq 1$8 for each $d \geq 1$9.

2. Geometric and Combinatorial Interpretation

A point in $d$0 gives a $d$1-vector assignment to each vertex, and the quadratic equations stipulate mutual orthogonality for prescribed non-edge pairs. This yields the affine algebraic variety: $d$2 which is the variety of all $d$3-dimensional orthogonal representations of the complement graph. For forests and trees, this variety decomposes into irreducible components precisely indexed by $d$4-admissible subsets, defined via matroidal ranks and combinatorial constraints (Liwski, 28 Dec 2025). For hypergraphs, LSS-ideals parametrize coordinate sections of symmetric tensor varieties (Gharakhloo et al., 2022).

3. Algebraic Properties and Invariants

Complete Intersection, Primality, and Radicality

For any graph $d$5, the algebraic properties of $d$6 are deeply governed by both graph-theoretic invariants and $d$7:

• If $d$8 is prime, it is a complete intersection; if it is a complete intersection, $d$9 is prime (Conca et al., 2018, Gharakhloo et al., 2022).
• These properties hereditarily persist to all subgraphs and incrementally in $G = ([n], E)$0.
• Define the positive matching decomposition number

  $G = ([n], E)$1

• For $G = ([n], E)$2, $G = ([n], E)$3 is radical and a complete intersection; for $G = ([n], E)$4, it is prime. This yields explicit bounds, e.g., for bipartite graphs $G = ([n], E)$5 (Conca et al., 2018, Gharakhloo et al., 2022).

The Forest and Tree Case

Let $G = ([n], E)$6 be a forest on $G = ([n], E)$7 vertices with maximum degree $G = ([n], E)$8. Then for all $G = ([n], E)$9 (Conca et al., 2018, Liwski, 28 Dec 2025, Nambi et al., 2023):

• $d \geq 1$0 is radical.
• $d \geq 1$1 is a complete intersection iff $d \geq 1$2.
• $d \geq 1$3 is prime iff $d \geq 1$4.

For trees, the explicit Gröbner basis, Hilbert series, and Krull dimension via combinatorial formulas are established (Ghouchan et al., 2023).

4. Primary and Irreducible Decomposition

In the forest case, the irreducible components of $d \geq 1$5 are indexed by $d \geq 1$6-admissible subsets $d \geq 1$7, with $d \geq 1$8 defined by killing coordinates $d \geq 1$9 for $$S = K[x_{i1}, x_{i2}, \ldots, x_{id} \mid i=1, \ldots, n],$$0, and joining with determinantal equations (Plücker-type minors) for dependent hyperplanes induced by the paving matroid $$S = K[x_{i1}, x_{i2}, \ldots, x_{id} \mid i=1, \ldots, n],$$1: $$S = K[x_{i1}, x_{i2}, \ldots, x_{id} \mid i=1, \ldots, n],$$2 where $$S = K[x_{i1}, x_{i2}, \ldots, x_{id} \mid i=1, \ldots, n],$$3 is generated by determinantal substitutions for neighborhoods of size at least $$S = K[x_{i1}, x_{i2}, \ldots, x_{id} \mid i=1, \ldots, n],$$4 (Liwski, 28 Dec 2025). This decomposition is explicit, and all components are prime.

5. Connections to Determinantal, Tensor, and Frame Ideals

There is a canonical transfer of radicality, primeness, and CI property from $$S = K[x_{i1}, x_{i2}, \ldots, x_{id} \mid i=1, \ldots, n],$$5 to the ideal $$S = K[x_{i1}, x_{i2}, \ldots, x_{id} \mid i=1, \ldots, n],$$6 of $$S = K[x_{i1}, x_{i2}, \ldots, x_{id} \mid i=1, \ldots, n],$$7-minors of the symmetric matrix with zero pattern determined by $$S = K[x_{i1}, x_{i2}, \ldots, x_{id} \mid i=1, \ldots, n],$$8 (Conca et al., 2018): $$S = K[x_{i1}, x_{i2}, \ldots, x_{id} \mid i=1, \ldots, n],$$9 Particular cases extend to Pfaffian (skew-symmetric) and bipartite versions, with all CI/primeness results preserved. For tensor varieties, the LSS-ideal for hypergraphs controls the irreducibility of coordinate sections of symmetric tensors of rank at most $\{i, j\}$0 (Gharakhloo et al., 2022).

6. Homological and Additional Algebraic Properties

• Betti numbers and resolutions: For $\{i, j\}$1, trees and odd unicyclic graphs admit explicit minimal free resolutions, with Betti numbers given by combinatorial formulas (Kumar, 2019).
• The symmetric algebra of LSS ideals is generated by commutativity and claw relations, corresponding respectively to pairs of edges and claws in the graph; the structure is typically linear except in almost CI cases (Kumar, 2019).
• For powers and almost CIs, projective dimension and regularity are calculated explicitly, with Cohen–Macaulayness of the associated graded ring and Rees algebra proved for almost CIs (Nambi et al., 2023).
• Koszul property: $\{i, j\}$2 is Koszul if $\{i, j\}$3 or $\{i, j\}$4; in particular, if $\{i, j\}$5 is a tree or unicyclic, $\{i, j\}$6 is always Koszul (Nambi et al., 2023).

7. Generalizations: Hypergraph and Twisted Ideals

For hypergraphs, LSS-ideals generalize with generators $\{i, j\}$7 for each edge $\{i, j\}$8 (Gharakhloo et al., 2022). The CI and primality criteria transport via positive matching decompositions ($\{i, j\}$9). Furthermore, twisted LSS-ideals $f_{ij} = \sum_{k=1}^d x_{ik} x_{jk} \in S.$0, defined using pairs of variables to encode antisymmetric forms, admit CI property when the twisted positive matching decomposition invariant $f_{ij} = \sum_{k=1}^d x_{ik} x_{jk} \in S.$1 is at most $f_{ij} = \sum_{k=1}^d x_{ik} x_{jk} \in S.$2 (Nambi et al., 2023).

Table: Key Combinatorial Invariants and Thresholds

Graph/Hypergraph Type	Invariant	CI iff	Prime iff
Forest	$f_{ij} = \sum_{k=1}^d x_{ik} x_{jk} \in S.$3	$f_{ij} = \sum_{k=1}^d x_{ik} x_{jk} \in S.$4	$f_{ij} = \sum_{k=1}^d x_{ik} x_{jk} \in S.$5
General Graph	$f_{ij} = \sum_{k=1}^d x_{ik} x_{jk} \in S.$6	$f_{ij} = \sum_{k=1}^d x_{ik} x_{jk} \in S.$7	$f_{ij} = \sum_{k=1}^d x_{ik} x_{jk} \in S.$8
Hypergraph	$f_{ij} = \sum_{k=1}^d x_{ik} x_{jk} \in S.$9	$d$0	$d$1
Twisted LSS-ideal	$d$2	$d$3	–

References and Further Reading

• "Lovasz-Saks-Schrijver ideals and coordinate sections of determinantal varieties" (Conca et al., 2018)
• "Lovász--Saks--Schrijver Ideals and the Irreducible Components of the Variety of Orthogonal Representations of a Graph" (Liwski, 28 Dec 2025)
• "Hypergraph LSS-ideals and coordinate sections of symmetric tensors" (Gharakhloo et al., 2022)
• "Gröbner basis and Krull dimension of Lovász-Saks-Sherijver ideal associated to a tree" (Ghouchan et al., 2023)
• "(Almost) Complete Intersection Lovász-Saks-Schrijver ideals and regularity of their powers" (Nambi et al., 2023)
• "Lovász–Saks–Schrijver ideals and parity binomial edge ideals of graphs" (Kumar, 2019)
• "The variety of orthogonal frames" (Casabella et al., 31 Dec 2025)

This research program interlaces combinatorics, commutative algebra, and algebraic geometry, yielding explicit links between graphical invariants and deep algebraic properties of associated ideals and varieties.