Related papers: Construction of Cohen-Macaulay binomial edge ideal…
In this paper we study the normality of monomial ideals using linear programming and graph theory. We give normality criteria for monomial ideals, for ideals generated by monomials of degree two, and for edge ideals of graphs and clutters…
We consider classes of codimension two Cohen--Macaulay ideals over a standard graded polynomial ring over a field. We revisit Vasconcelos' problem on $3\times 2$ matrices with homogeneous entries and describe the homological details of…
In this paper we give new upper bounds on the regularity of edge ideals whose resolutions are k-steps linear; surprisingly, the bounds are logarithmic in the number of variables. We also give various bounds for the projective dimension of…
A rational map whose source and image are projectively embedded varieties has an {\em Arithmetically Cohen-Macaulay graph} if the Rees algebra of one (hence any) of its base ideals is a Cohen-Macaulay ring. If the map is birational onto the…
We associate a {\it skew tableau ideal} to each filling of a skew Ferrers diagram with positive integers. We classify all unmixed and sequentially Cohen-Macaulay skew tableau ideals. Consequently, we classify all Cohen-Macaulay, Buchsbaum,…
Let $R$ be a standard graded polynomial ring over a field $k$. The paper focuses on homogeneous ideals $J \subset R$ of codimension $2$ generated by three forms of the same degree $d \geq 2$ that are almost Cohen--Macaulay, i.e., of…
In this paper we study the main characteristics of some evaluation codes parameterized by the edges of a bipartite graph with a perfect matching.
We introduce a family of graphs, which we call down-left graphs, and study their combinatorial and algebraic properties. We show that members of this family are well-covered, $C_5$-free, and vertex decomposable. By applying a result of…
Let $R=K[x_1,\ldots,x_n]$ be the polynomial ring in $n$ variables over a field $K$. We show that if $G$ is a connected graph with a basic $5$-cycle $C$, then $G$ is a sequentially Cohen-Macaulay graph if and only if there exists a shedding…
In this work, we investigate the transfer of some homological properties from a ring $R$ to his amalgamated duplication along some ideal $I$ of $R$, and then generate new and original families of rings with these properties.
In this paper we study the (Cohen-Macaulay) type of orders over Dedekind domains in \'etale algebras. We provide a bound for the type, and give formulas to compute it. We relate the type of the overorders of a given order to the size of…
Given two determinantal rings over a field k. We consider the Rees algebra of the diagonal ideal, the kernel of the multiplication map. The special fiber ring of the diagonal ideal is the homogeneous coordinate ring of the join variety.…
The edges of any hypergraph parametrize a monomial algebra called the edge subring of the hypergraph. We study presentation ideals of these edge subrings, and describe their generators in terms of balanced walks on hypergraphs. Our results…
We introduce a new class of algebras arising from graphs, called binomial edge rings. Given a graph $G$ on $d$ vertices with $n$ edges, the binomial edge ring of $G$ is defined to be the subalgebra of the polynomial ring with $2d$ variables…
This paper is devoted to the construction of norm-preserving maps between bounded cohomology groups. For a graph of groups with amenable edge groups we construct an isometric embedding of the direct sum of the bounded cohomology of the…
Throughout this work, the vertex decomposability and shellability of graphs formed from other graphs by various operations are investigated. Also among the other things, by using some graph operations, new classes of Cohen-Macaulay graphs…
We show that the Castelnuovo-Mumford regularity of the binomial edge ideal of a graph is bounded below by the length of its longest induced path and bounded above by the number of its vertices.
Let $A$ be a commutative Noetherian local ring with maximal ideal $\mathfrak{m}$, and let $I$ be an ideal. The fiber cone is then an image of the polynomial ring over the residue field $A/\mathfrak{m}$. The kernel of this map is called the…
A very well-covered graph is an unmixed graph without isolated vertices such that the height of its edge ideal is half of the number of vertices. We study these graphs by means of Betti splittings and mapping cone constructions. We show…
We study two different types of gluing for graphs: interface (obtained by choosing a common subgraph as the gluing component) and bridge gluing (obtained by adding a set of edges to the given subgraphs). We introduce formulae for computing…