相关论文: Monomial and toric ideals associated to Ferrers gr…

We construct the minimal resolutions of three classes of monomial ideals: dominant, 1-semidominant, and 2-semidominant ideals. The families of dominant and 1-semidominant ideals extend those of complete and almost complete intersections. We…

We study homological properties of random quadratic monomial ideals in a polynomial ring $R = {\mathbb K}[x_1, \dots x_n]$, utilizing methods from the Erd\"{o}s-R\'{e}nyi model of random graphs. Here for a graph $G \sim G(n, p)$ we consider…

Let $G$ be a simple finite graph. A famous theorem of Dirac says that $G$ is chordal if and only if $G$ admits a perfect elimination order. It is known by Fr\"oberg that the edge ideal $I(G)$ of $G$ has a linear resolution if and only if…

A graph is chordal if every cycle of length at least four contains a chord, that is, an edge connecting two nonconsecutive vertices of the cycle. Several classical applications in sparse linear systems, database management, computer vision,…

We provide some new conditions under which the graded Betti numbers of a monomial ideal can be computed in terms of the graded Betti numbers of smaller ideals, thus complementing Eliahou and Kervaire's splitting approach. As applications,…

The distance ideals of graphs are algebraic invariants that generalize the Smith normal form (SNF) and the spectrum of several distance matrices associated with a graph. In general, distance ideals are not monotone under taking induced…

We give an explicit formula for the Hilbert-Poincar\'{e} series of the parity binomial edge ideal of a complete graph $K_{n}$ or equivalently for the ideal generated by all $2\times 2$-permanents of a $2\times n$-matrix. It follows that the…

We define the Buchberger resolution, which is a graded free resolution of a monomial ideal in a polynomial ring. Its construction uses a generalization of the Buchberger graph and encodes much of the combinatorics of the Buchberger…

A special class of algebras which are intermediate between the symmetric and the Rees algebras of an ideal was introduced by P. Aluffi in 2004 to define characteristic cycle of a hypersurface parallel to conormal cycle in intersection…

Let $A=\{{\bf a}_1,...,{\bf a}_m\} \subset \mathbb{Z}^n$ be a vector configuration and $I_A \subset K[x_1,...,x_m]$ its corresponding toric ideal. The paper consists of two parts. In the first part we completely determine the number of…

We study the ideals of the partition, Brauer, and Jones monoid, establishing various combinatorial results on generating sets and idempotent generating sets via an analysis of their Graham--Houghton graphs. We show that each proper ideal of…

Poljak and Turzik (Discrete Mathematics 1986) introduced the notion of {\lambda}-extendible properties of graphs as a generalization of the property of being bipartite. They showed that for any 0 < {\lambda} < 1 and {\lambda}-extendible…

Let $(R,\mm)$ be a Noetherian local ring and $M$ a finitely generated $R$-module. We say $M$ has maximal depth if there is an associated prime $\pp$ of $M$ such that $\depth M=\dim R/\pp$. In this paper we study squarefree monomial ideals…

Let (P,<) be a finite poset and let G be its comparability graph. If cl(G) is the clutter of maximal cliques of G, we prove that cl(G) satisfies the max-flow min-cut property and that its edge ideal is normally torsion free. We prove that…

We introduce and study monomial ideals with regular quotients, which can be seen as an extension of monomial ideals with linear quotients. Based on these investigations, we are able to calculate the Betti numbers of toric ideals belonging…

We compute a number of invariants of singularities defined via the Frobenius morphism for seminormal affine toric varieties over fields of characteristic p > 0. Our main technical tool is a combinatorial description of the potential…

Motivated by questions about square-free monomial ideals in polynomial rings, in 2010 Francisco et al. conjectured that for every positive integer k and every k-critical (i.e., critically k-chromatic) graph, there is a set of vertices whose…

We investigate the Rees algebra and the toric ring of the squarefree monomial ideal associated to the three-dimensional Ferrers diagram. Under the projection property condition, we describe explicitly the presentation ideals of the Rees…

A finite simple graph is called a 2-graph if all of its unit spheres S(x) are cyclic graphs of length 4 or larger. A 2-graph G is Eulerian if all vertex degrees of G are even. An edge refinement of a graph splits an edge (a,b) to two edges…

We introduce the concept of minimum edge cover for an induced subgraph in a graph. Let $G$ be a unicyclic graph with a unique odd cycle and $I=I(G)$ be its edge ideal. We compute the exact values of all symbolic defects of $I$ using the…