相关论文: Subadditivity, strand connectivity and multigraded…

The path ideal (of length t >=2) of a graph G is the monomial ideal, denoted I_t(G), whose generators correspond to the directed paths of length t in G. We study some of the algebraic properties of I_t(G) when G is a tree. We first show…

A determinantal facet ideal (DFI) is an ideal $J_\Delta$ generated by maximal minors of a generic matrix parametrized by an associated simplicial complex $\Delta$. In this paper, we construct an explicit linear strand for the initial ideal…

We determine the Castelnuovo-Mumford regularity of binomial edge ideals of complement reducible graphs (cographs). For cographs with $n$ vertices the maximum regularity grows as $2n/3$. We also bound the regularity by graph theoretic…

Let $S=K[x_1, \ldots,x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and let $I \subset S$ be a monomial ideal. For a vector $\mathfrak{c}\in\mathbb{N}^n$, we set $I_{\mathfrak{c}}$ to be the ideal generated by monomials…

We will study monomial ideals $I$ in the exterior algebra as well as in the polynomial ring whose generic initial ideal is constant for all term orders up to permutations of variables. First, in the exterior algebra, we determine all graphs…

We prove two recent conjectures on some upper bounds for the Castelnuovo-Mumford regularity of the binomial edge ideals of some different classes of graphs. We prove the conjecture of Matsuda and Murai for graphs which has a cut edge or a…

Well ordered covers of square-free monomial ideals are subsets of the minimal generating set ordered in a certain way that give rise to a Lyubeznik resolution for the ideal, and have guaranteed nonvanishing Betti numbers in certain degrees.…

Let $R$ be a smooth affine algebra over an infinite perfect field $k$. Let $I\subset R$ be an ideal, $\omega_I:(R/I)^n\to I/I^2$ a surjective homomorphism and $Q_{2n}\subset \mathbb{A}^{2n+1}$ be the smooth quadric defined by the equation…

In this paper, we compare the $\mathrm{v}$-numbers and the degree of the $h$-polynomials associated with edge ideals of connected graphs. We prove that the $\mathrm{v}$-number can be arbitrarily larger or smaller than the degree of the…

In this paper we investigate the Rees algebras of squarefree monomial ideals $I \subset S=K[x_1,\dots,x_n]$ generated in degree $n-2$, where $K$ is a field. Every such ideal arises as the complementary edge ideal $I_c(G)$ of a finite simple…

In this paper,we introduce the monomial ideals I(H) associated to a special class of non uniform hypergraphs H(X; E; d) namely uniformly increasing hypergraphs. These ideals are named as inclusion ideals. In this paper, we discuss some…

In this paper we consider a natural extremal graph theoretic problem of topological sort, concerning the minimization of the (topological) connectedness of the independence complex of graphs in terms of its dimension. We observe that the…

For $t\geq 2$, the $t$-independence complex $\mathrm{Ind}_t(G)$ of a graph $G$ is the collection of all $A\subseteq V(G)$ such that each connected component of the induced subgraph $G[A]$ has at most $t-1$ vertices. The topology of…

In this thesis we investigate certain types of monomial ideals of polynomial rings over fields. We are interested in minimal free resolutions of these ideals (or equivalently the quotients of the polynomial ring by the ideals) considered as…

Given a simple graph $G$, a poset of its even subgraphs was firstly considered by S. Choi and H. Park to study the topology of a real toric manifold associated with $G$. S. Choi and the authors extended this to a graph allowing multiple…

We characterize all graphs whose binomial edge ideals have pure resolutions. Moreover, we introduce a new switching of graphs which does not change some algebraic invariants of graphs, and using this, we study the linear strand of the…

In this paper we give upper bounds for the regularity of edge ideal of some classes of graphs in terms of invariants of graph. We introduce two numbers $a'(G)$ and $n(G)$ depending on graph $G$ and show that for a vertex decomposable graph…

Let $K$ be a field and $I$ a monomial ideal of the polynomial ring $S=K[x_1,\ldots, x_n]$. We show that if either: 1) $I$ is almost complete intersection, 2) $I$ can be generated by less than four monomials; or 3) $I$ is the Stanley-Reisner…

We classify the bipartite graphs $G$ whose binomial edge ideal $J_G$ is Cohen-Macaulay. The connected components of such graphs can be obtained by gluing a finite number of basic blocks with two operations. In this context we prove the…

We study various ideals arising in the theory of system reliability. We use ideas from the theory of divisors, orientations and matroids on graphs to describe the minimal polyhedral cellular free resolutions of these ideals. In each case we…