In this paper, we investigate the arithmetical rank of a binomial ideal J. We provide lower bounds for the binomial arithmetical rank and the J-complete arithmetical rank of J. Special attention is paid to the case where J is the binomial edge ideal of a graph. We compute the arithmetical rank of such an ideal in various cases. © 2017, Springer International Publishing AG
In this thesis, we study the binomial edge ideals associated with graphs. We review their reduced Gr...
We show that for the edge ideals of the graphs consisting of one cycle or two cycles of any length c...
We prove that, for the edge ideal of a cactus graph, the arithmetical rank is bounded above by the ...
Let $G$ be a connected and simple graph on the vertex set $[n]$. To the graph $G$ one can associate ...
We show that for the edge ideals of the graphs consisting of one cycle or two cycles of any length c...
Abstract: In this paper, we present some lower bounds and upper bounds on the arithmetical rank of t...
We prove that, for the edge ideal of a graph whose cycles are pairwise vertex-disjoint, the arithme...
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 determine, in a polynomial ring over a field, the arithmetical rank of certain ideals generated b...
In this paper, we compute the projective dimension of the edge ideals of graphs consisting of some c...
In this paper, we provide the necessary and sufficient conditions for the edge binomials of the tree...
The main goal of this paper is to characterize a particular class of ideals whose structure can stil...
In this paper we introduce the concept of generalized trees and compute the Hilbert series of their ...
Producción CientíficaA congruence on Nn is an equivalence relation on Nn that is compatible wi...
In this thesis, we study the binomial edge ideals associated with graphs. We review their reduced Gr...
We show that for the edge ideals of the graphs consisting of one cycle or two cycles of any length c...
We prove that, for the edge ideal of a cactus graph, the arithmetical rank is bounded above by the ...
Let $G$ be a connected and simple graph on the vertex set $[n]$. To the graph $G$ one can associate ...
We show that for the edge ideals of the graphs consisting of one cycle or two cycles of any length c...
Abstract: In this paper, we present some lower bounds and upper bounds on the arithmetical rank of t...
We prove that, for the edge ideal of a graph whose cycles are pairwise vertex-disjoint, the arithme...
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 determine, in a polynomial ring over a field, the arithmetical rank of certain ideals generated b...
In this paper, we compute the projective dimension of the edge ideals of graphs consisting of some c...
In this paper, we provide the necessary and sufficient conditions for the edge binomials of the tree...
The main goal of this paper is to characterize a particular class of ideals whose structure can stil...
In this paper we introduce the concept of generalized trees and compute the Hilbert series of their ...
Producción CientíficaA congruence on Nn is an equivalence relation on Nn that is compatible wi...
In this thesis, we study the binomial edge ideals associated with graphs. We review their reduced Gr...
We show that for the edge ideals of the graphs consisting of one cycle or two cycles of any length c...
We prove that, for the edge ideal of a cactus graph, the arithmetical rank is bounded above by the ...
DOI
Add to ORKG