The algebra of basic covers of a graph G, denoted by A¯(G), was introduced by Herzog as a suitable quotient of the vertex cover algebra. In this paper we compute the Krull dimension of A¯(G) in terms of the combinatorics of G. As a consequence, we get new upper bounds on the arithmetical rank of monomial ideals of pure codimension 2. Furthermore, we show that if the graph is bipartite, then A¯(G) is a homogeneous algebra with straightening laws, and thus it is Koszul. Finally, we characterize the Cohen–Macaulay property and the Castelnuovo–Mumford regularity of the edge ideal of a certain class of graphs
In this paper, we compute the projective dimension of the edge ideals of graphs consisting of some c...
AbstractWe have established in previous papers that coordinatizations of a combinatorial geometry G ...
Our aim in this thesis is to compute certain algebraic invariants like primary decomposition, dimens...
We study the basic k-covers of a bipartite graph G; the algebra A(G) they span, first studied by Her...
In this dissertation, we study numerical invariants of minimal graded free resolu-tions of homogeneo...
In this dissertation, we study numerical invariants of minimal graded free resolutions of homogeneou...
We study the algebraic invariants namely depth, Stanley depth, regularity and projective dimension o...
In this thesis we classify all unmixed monomial ideals I of codimension 2 which are generically a co...
We describe a combinatorial condition on a graph which guarantees that all powers of its vertex cove...
We extend the sortability concept to monomial ideals which are not necessarily generated in one degr...
We study the Hilbert function and the Hilbert series of the vertex cover algebra A(G), where G is a ...
Let $G$ be a connected and simple graph on the vertex set $[n]$. To the graph $G$ one can associate ...
AbstractWe introduce and study vertex cover algebras of weighted simplicial complexes. These algebra...
A new connection between combinatorics and noncommutative algebra is established by relating a certa...
We show that for the edge ideals of the graphs consisting of one cycle or two cycles of any length c...
In this paper, we compute the projective dimension of the edge ideals of graphs consisting of some c...
AbstractWe have established in previous papers that coordinatizations of a combinatorial geometry G ...
Our aim in this thesis is to compute certain algebraic invariants like primary decomposition, dimens...
We study the basic k-covers of a bipartite graph G; the algebra A(G) they span, first studied by Her...
In this dissertation, we study numerical invariants of minimal graded free resolu-tions of homogeneo...
In this dissertation, we study numerical invariants of minimal graded free resolutions of homogeneou...
We study the algebraic invariants namely depth, Stanley depth, regularity and projective dimension o...
In this thesis we classify all unmixed monomial ideals I of codimension 2 which are generically a co...
We describe a combinatorial condition on a graph which guarantees that all powers of its vertex cove...
We extend the sortability concept to monomial ideals which are not necessarily generated in one degr...
We study the Hilbert function and the Hilbert series of the vertex cover algebra A(G), where G is a ...
Let $G$ be a connected and simple graph on the vertex set $[n]$. To the graph $G$ one can associate ...
AbstractWe introduce and study vertex cover algebras of weighted simplicial complexes. These algebra...
A new connection between combinatorics and noncommutative algebra is established by relating a certa...
We show that for the edge ideals of the graphs consisting of one cycle or two cycles of any length c...
In this paper, we compute the projective dimension of the edge ideals of graphs consisting of some c...
AbstractWe have established in previous papers that coordinatizations of a combinatorial geometry G ...
Our aim in this thesis is to compute certain algebraic invariants like primary decomposition, dimens...