English
Related papers

Related papers: A special case of Postnikov-Shapiro conjecture

200 papers

Let J be a strongly stable monomial ideal in P=k[X0,...,Xn] and let BSt(J) be the family of all the homogeneous ideals in P such that the set N(J) of all the monomials that do not belong to J is a k-vector basis of the quotient P/I. We show…

Commutative Algebra · Mathematics 2010-05-05 Margherita Roggero

A strong interaction is known to exist between edge-colored graphs (which encode PL pseudo-manifolds of arbitrary dimension) and random tensor models (as a possible approach to the study of Quantum Gravity). The key tool is the {\it…

Geometric Topology · Mathematics 2018-10-03 Maria Rita Casali , Luigi Grasselli

Let G be a finite group, (g_{1},...,g_{r}) an (unordered) r-tuple of G^{(r)} and x_{i,g_i}'s variables that correspond to the g_i's, i=1,...,r. Let F<x_{1,g_1},...,x_{r,g_r}> be the corresponding free G-graded algebra where F is a field of…

Rings and Algebras · Mathematics 2017-12-05 Eli Aljadeff , Alexei Kanel-Belov

This paper studies the zero-divisor graphs attached to several finite chain-ring families and computes the homological invariants of their edge ideals by using cochordal constructible systems. We begin with a general layered graph $C(q,L)$,…

Commutative Algebra · Mathematics 2026-05-14 Bilal Ahmad Rather

Caro, Davila, and Pepper (arXiv:1909.09093) recently proved $\delta(G) \alpha(G)\leq \Delta(G) \mu(G)$ for every graph $G$ with minimum degree $\delta(G)$, maximum degree $\Delta(G)$, independence number $\alpha(G)$, and matching number…

Combinatorics · Mathematics 2019-10-28 Elena Mohr , Dieter Rautenbach

Let $G$ be a graph with $n$ vertices and let $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over a field $\mathbb{K}$. Assume that $I(G)$ and $J(G)$ denote the edge ideal and the cover ideal of $G$, respectively. We…

Commutative Algebra · Mathematics 2023-08-22 Seyed Amin Seyed Fakhari , Siamak Yassemi

In this article we prove that every toric ideal associated with a gap-free graph $G$ has a squarefree lexicographic initial ideal. Moreover, in the particular case when the complementary graph of $G$ is chordal (i.e. when the edge ideal of…

Commutative Algebra · Mathematics 2020-06-17 Alessio D'Alì

Let $S = K[x_1, \dots, x_n]$ be the standard graded polynomial ring over a field $K$. In this paper, we address and completely solve two fundamental open questions in Commutative Algebra: (i) For which degrees $d$, does there exist a…

Commutative Algebra · Mathematics 2025-08-15 Antonino Ficarra , Somayeh Moradi

Let $G$ be a simple graph on $n$ vertices and $\mathcal{I}_G$ denotes parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots, y_n].$ We obtain a lower bound for the regularity of parity…

Commutative Algebra · Mathematics 2021-08-20 Arvind Kumar

We prove two recent conjectures on some upper bounds for the Castelnuovo-Mumford regularity of the binomial edge ideals of some different classes of graphs. We prove the conjecture of Matsuda and Murai for graphs which has a cut edge or a…

Commutative Algebra · Mathematics 2013-11-19 Dariush Kiani , Sara Saeedi Madani

In this paper, we compare the $\mathrm{v}$-numbers and the degree of the $h$-polynomials associated with edge ideals of connected graphs. We prove that the $\mathrm{v}$-number can be arbitrarily larger or smaller than the degree of the…

Commutative Algebra · Mathematics 2025-07-21 Kamalesh Saha , Adam Van Tuyl

Let $G$ be a finite simple graph and $I(G)$ denote the corresponding edge ideal. For all $s \geq 1$, we obtain upper bounds for reg$(I(G)^s)$ for bipartite graphs. We then compare the properties of $G$ and $G'$, where $G'$ is the graph…

Commutative Algebra · Mathematics 2016-09-07 A V Jayanthan , N Narayanan , S Selvaraja

Several algebraic properties of a binomial edge ideal $J_G$ can be interpreted in terms of combinatorial properties of its associated graph $G$. In particular, the so-called cut sets of a graph $G$, special sets of vertices that disconnect…

Combinatorics · Mathematics 2025-01-30 Davide Bolognini , Antonio Macchia , Giancarlo Rinaldo , Francesco Strazzanti

Let $G$ be a simple graph of order $n$ with eigenvalues $\lambda_1(G)\geq \cdots \geq \lambda_n(G)$. Define \[s^+(G)=\sum_{\lambda_i >0} \lambda_i^2(G), \quad s^-(G)=\sum_{\lambda_i<0} \lambda_i^2(G).\] It was conjectured by Elphick,…

Combinatorics · Mathematics 2025-06-10 Saieed Akbari , Hitesh Kumar , Bojan Mohar , Shivaramakrishna Pragada , Shengtong Zhang

Given a homogeneous ideal I of a polynomial ring A=K[X_1,...,X_n] and a monomial order, we construct a new monomial ideal of A associated with I. We call it the zero-generic initial ideal of I with respect to the order and denote it with…

Commutative Algebra · Mathematics 2014-03-11 Giulio Caviglia , Enrico Sbarra

Let $S=\mathbb{K}[x_1,\dots, x_n]$ be a polynomial ring, where $\mathbb{K}$ is a field, and $G$ be a simple graph on $n$ vertices. Let $J(G)\subset S$ be the vertex cover ideal of $G$. Herzog, Hibi and Ohsugi have conjectured that all…

Commutative Algebra · Mathematics 2021-02-09 Ajay Kumar , Rajiv Kumar

For a graph $G$, $\chi(G)$ denotes the chromatic number of $G$ and $\omega(G)$ denotes the size of the largest clique in $G$. A hereditary class of graphs is called $\chi$-bounded if there is a function $f$ such that for each graph $G$ in…

Combinatorics · Mathematics 2026-02-13 Kathie Cameron , Ni Luh Dewi Sintiari , Sophie Spirkl

We give conjectures on the possible graded Betti numbers of Cohen-Macaulay modules up to multiplication by positive rational numbers. The idea is that the Betti diagrams should be non-negative linear combinations of pure diagrams. The…

Commutative Algebra · Mathematics 2014-02-26 Mats Boij , Jonas Söderberg

We introduce the concept of matching powers of monomial ideals. Let $I$ be a monomial ideal of $S=K[x_1,\dots,x_n]$, with $K$ a field. The $k$th matching power of $I$ is the monomial ideal $I^{[k]}$ generated by the products $u_1\cdots u_k$…

Commutative Algebra · Mathematics 2024-03-28 Nursel Erey , Antonino Ficarra

Appearing in different format, Gupta\,(1967), Goldberg\,(1973), Andersen\,(1977), and Seymour\,(1979) conjectured that if $G$ is an edge-$k$-critical graph with $k \ge \Delta +1$, then $|V(G)|$ is odd and, for every edge $e$, $E(G-e)$ is a…

Combinatorics · Mathematics 2018-09-20 Guantao Chen , Guangming Jing