Related papers: Lovasz-Saks-Schrijver ideals and coordinate sectio…

Given a finite simple graph $G$ and a positive integer $d$, one can associate to $G$ the Lov\'asz--Saks--Schrijver ideal $L_{G}(d)$, an ideal generated by quadratic polynomials coming from orthogonality conditions. The corresponding variety…

Let $G$ be a simple graph on $n$ vertices. Let $L_G \text{ and } \mathcal{I}_G \: $ denote the Lov\'asz-Saks-Schrijver(LSS) ideal and parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots,…

In this paper, we study orthogonal representations of simple graphs $G$ in $\mathbb{R}^d$ from an algebraic perspective in case $d = 2$. Orthogonal representations of graphs, introduced by Lov\'asz, are maps from the vertex set to…

Every simple finite graph $G$ has an associated Lov\'asz-Saks-Schrijver ring $R_G(d)$ that is related to the $d$-dimensional orthogonal representations of $G$. The study of $R_G(d)$ lies at the intersection between algebraic geometry,…

Let K be a field, [n]= {1,...,n} and H=([n],E) be a hypergraph. For an integer d >= 1 the Lovasz-Saks-Schrijver ideal (LSS-ideal) L_H^K (d) in K[y_{ij}~:~(i,j) \in [n] x [d]] is the ideal generated by the polynomials $f^{(d)}_{e}=…

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…

We introduce some determinantal ideals of the generalized Laplacian matrix associated to a digraph G, that we call critical ideals of G. Critical ideals generalize the critical group and the characteristic polynomials of the adjacency and…

We study d-dimensional generalizations of three mutually related topics in graph theory: Hamiltonian paths, (unit) interval graphs, and binomial edge ideals. We provide partial high-dimensional generalizations of Ore and Posa's sufficient…

Let $S=K[x_1,\dots,x_n]$ be the polynomial ring over a field $K$ and $I\subset S$ be a squarefree monomial ideal generated in degree $n-2$. Motivated by the remarkable behavior of the powers of $I$ when $I$ admits a linear resolution, as…

We study a class of combinatorially-defined polynomial ideals which are generated by minors of a generic symmetric matrix. Included within this class are the symmetric determinantal ideals, the symmetric ladder determinantal ideals, and the…

We give a one-to-one correspondence between ideals in the Steinberg algebra of a Hausdorff ample groupoid $G$, and certain families of ideals in the group algebras of isotropy groups in $G$. This generalises a known ideal correspondence…

Let $\mathbb{K}$ be a field and $n$ be a positive integer. Let $\Gamma =([n], E)$ be a simple graph, where $[n]=\{1,\ldots, n\}$. If $S=\mathbb{K}[x_1, \ldots, x_n, y_1, \ldots, y_n]$ is a polynomial ring, then the graded ideal \[…

Let R be a commutative Noetherian ring. Licci ideals are the ideals of R that can be linked in a finite number of steps to a complete intersection. Each licci ideal admits a rigid deformation, and two licci ideals are in the same Herzog…

The subject of this work is the study of $\LS_+$-perfect graphs defined as those graphs $G$ for which the stable set polytope $\stab(G)$ is achieved in one iteration of Lov\'asz-Schrijver PSD-operator $\LS_+$, applied to its edge relaxation…

We study the Lov\'asz-Schrijver lift-and-project operator ($LS_+$) based on the cone of symmetric, positive semidefinite matrices, applied to the fractional stable set polytope of graphs. The problem of obtaining a combinatorial…

In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…

This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…

In this paper, we study the componentwise linearity of edge ideals of weighted oriented graphs. We show that if $D$ is a weighted oriented graph whose edge ideal $I(D)$ is componentwise linear, then the underlying simple graph $G$ of $D$ is…

Kazhdan-Lusztig ideals, a family of generalized determinantal ideals investigated in [Woo-Yong '08], provide an explicit choice of coordinates and equations encoding a neighbourhood of a torus-fixed point of a Schubert variety on a type A…

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over a field $K$, and let $A$ be a finitely generated standard graded $S$-algebra. We show that if the defining ideal of $A$ has a quadratic initial ideal, then all the graded components of…