Related papers: Some Computations for Binomial Edge Ideals and Kos…

Let $G$ be a simple connected non-complete graph and $J_G$ be its binomial edge ideal in a polynomial ring $S$. Using certain invariants associated to graphs, say $U(G)$, Banerjee and N\'{u}\~{n}ez-Betancourt gave an upper bound for the…

One can iteratively obtain a free resolution of any monomial ideal $I$ by considering the mapping cone of the map of complexes associated to adding one generator at a time. Herzog and Takayama have shown that this procedure yields a minimal…

We consider arrangements of tropical hyperplanes where the apices of the hyperplanes are taken to infinity in certain directions. Such an arrangement defines a decomposition of Euclidean space where a cell is determined by its `type' data,…

We make explicit the exponential bound on the degrees of the polynomials appearing in the Effective Quillen-Suslin Theorem, and apply it jointly with the Hilbert-Burch Theorem to show that the syzygy module of a sequence of m polynomials in…

Let G be a finite graph on [n] = {1,2,3,...,n}, X a 2 times n matrix of indeterminates over a field K, and S = K[X] a polynomial ring over K. In this paper, we study about ideals I_G of S generated by 2-minors [i,j] of X which correspond to…

Associated to any graph is a toric ideal whose generators record relations among the cuts of the graph. We study these ideals and the geometry of the corresponding toric varieties. Our theorems and conjectures relate the combinatorial…

Ohsugi and Hibi characterized the edge ring of a finite connected simple graph with a $2$-linear resolution. On the other hand, Hibi, Matsuda and the author conjectured that the edge ring of a finite connected simple graph with a $q$-linear…

We introduce a notion of Koszul A-infinity algebra that generalizes Priddy's notion of a Koszul algebra and we use it to construct small A-infinity algebra models for Hochschild cochains. As an application, this yields new techniques for…

Let $G$ be a simple graph on the vertex set $[n]$ and $J_G$ be the corresponding binomial edge ideal. Let $G=v*H$ be the cone of $v$ on $H$. In this article, we compute all the Betti numbers of $J_G$ in terms of Betti number of $J_H$ and as…

Edge ideals of finite simple graphs $G$ on $n$ vertices are the ideals $I(G)$ of the polynomial ring $S$ in $n$ variables generated by the quadratic monomials associated with the edges of $G$. In this paper, we consider the possible pairs…

We study the algebraic invariants namely depth, Stanley depth, regularity and projective dimension of the residue class rings of the edge ideals associated with the corona product of various classes of graphs with any graph. We also give an…

In this article we study higher preprojective algebras, showing that various known results for ordinary preprojective algebras generalize to the higher setting. We first show that the quiver of the higher preprojective algebra is obtained…

In this article we introduce the notion of multi-Koszul algebra for the case of a locally finite dimensional nonnegatively graded connected algebra, as a generalization of the notion of (generalized) Koszul algebras defined by R. Berger for…

We discuss the notion of Poincar\'e duality for graded algebras and its connections with the Koszul duality for quadratic Koszul algebras. The relevance of the Poincar\'e duality is pointed out for the existence of twisted potentials…

Avramov, Conca, and Iyengar ask whether $\beta_i^S(R) \leq \binom{g}{i}$ for all $i$ when $R=S/I$ is a Koszul algebra minimally defined by $g$ quadrics. In recent work, we give an affirmative answer to this question when $g \leq 4$ by…

In this paper it is shown that it is possible to associate several polynomial ideals to a directed graph $D$ in order to find properties of it. In fact by using algebraic tools it is possible to give appropriate procedures for automatic…

In contrast to the univariate case, interpolation with polynomials of a given maximal total degree is not always possible even if the number of interpolation points and the space dimension coincide. Due to that, numerous constructions for…

We introduce and study the concept which we call the splitting of a graph and compare algebraic properties of the edge ideals of graphs and those of their splitting graphs.

An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…

Fr\"oberg's classical theorem about edge ideals with $2$-linear resolution can be regarded as a classification of graphs whose edge ideals have linearity defect zero. Extending his theorem, we classify all graphs whose edge ideals have…