Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userHomological invariants of Cameron--Walker graphs
117
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Let $G$ be a finite simple connected graph on $[n]$ and $R = K[x_1, ldots, x_n]$ the polynomial ring in $n$ variables over a field $K$. The edge ideal of $G$ is the ideal $I(G)$ of $R$ which is generated by those monomials $x_ix_j$ for which ${i, j}$ is an edge of $G$. In the present paper, the possible tuples $(n, {rm depth} (R/I(G)), {rm reg} (R/I(G)), dim R/I(G), {rm deg} h(R/I(G)))$, where ${rm deg} h(R/I(G))$ is the degree of the $h$-polynomial of $R/I(G)$, arising from Cameron--Walker graphs on $[n]$ will be completely determined.
rate research
Read More
The goal of the present paper is the study of some algebraic invariants of Stanley-Reisner rings of Cohen-Macaulay simplicial complexes of dimension $d - 1$. We prove that the inequality $d leq mathrm{reg}(Delta) cdot mathrm{type}(Delta)$ holds for any $(d-1)$-dimensional Cohen-Macaulay simplicial complex $Delta$ satisfying $Delta=mathrm{core}(Delta)$, where $mathrm{reg}(Delta)$ (resp. $mathrm{type}(Delta)$) denotes the Castelnuovo-Mumford regularity (resp. Cohen-Macaulay type) of the Stanley-Reisner ring $Bbbk[Delta]$. Moreover, for any given integers $d,r,t$ satisfying $r,t geq 2$ and $r leq d leq rt$, we construct a Cohen-Macaulay simplicial complex $Delta(G)$ as an independent complex of a graph $G$ such that $dim(Delta(G))=d-1$, $mathrm{reg}(Delta(G))=r$ and $mathrm{type}(Delta(G))=t$.
Let $G$ be a simple graph and $I(G)$ be its edge ideal. In this article, we study the Castelnuovo-Mumford regularity of symbolic powers of edge ideals of join of graphs. As a consequence, we prove Minhs conjecture for wheel graphs, complete multipartite graphs, and a subclass of co-chordal graphs. We obtain a class of graphs whose edge ideals have regularity three. By constructing graphs, we prove that the multiplicity of edge ideals of graphs is independent from the depth, dimension, regularity, and degree of $h$-polynomial. Also, we demonstrate that the depth of edge ideals of graphs is independent from the regularity and degree of $h$-polynomial by constructing graphs.
Let $I_G$ be the toric ideal of a graph $G$. We characterize in graph theoretical terms the primitive, the minimal, the indispensable and the fundamental binomials of the toric ideal $I_G$.
The aim of this paper is to study integer rounding properties of various systems of linear inequalities to gain insight about the algebraic properties of Rees algebras of monomial ideals and monomial subrings. We study the normality and Gorenstein property--as well as the canonical module and the a-invariant--of Rees algebras and subrings arising from systems with the integer rounding property. We relate the algebraic properties of Rees algebras and monomial subrings with integer rounding properties and present a duality theorem.
In this paper we prove the conjectured upper bound for Castelnuovo-Mumford regularity of binomial edge ideals posed in [23], in the case of chordal graphs. Indeed, we show that the regularity of any chordal graph G is bounded above by the number of maximal cliques of G, denoted by c(G). Moreover, we classify all chordal graphs G for which L(G) = c(G), where L(G) is the sum of the lengths of longest induced paths of connected components of G. We call such graphs strongly interval graphs. Moreover, we show that the regularity of a strongly interval graph G coincides with L(G) as well as c(G).
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
