Regularity and a-invariant of Cameron-Walker graphs

DOI10.1016/J.JALGEBRA.2021.05.007MaRDI QIDQ2035829zbMATH OpenOpenAlexFDO

Authors Takayuki Hibi, Kyouko Kimura, Kazunori Matsuda, Akiyoshi Tsuchiya

Publication date 25 June 2021

Published in Journal of Algebra (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1901.01509

zbMATH Keywords

\(a\)-invariantCameron-Walker graphCastelnuovo-Mumford regularityedge ideal

Mathematics Subject Classification ID

Combinatorial aspects of commutative algebra (05E40) General commutative ring theory and combinatorics (zero-divisor graphs, annihilating-ideal graphs, etc.) (13A70) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Special types (Cohen-Macaulay, Gorenstein, Buchsbaum, etc.) (13H10)

Abstract: Let $S$ be the polynomial ring over a field $K$ and $IsubsetS$ a homogeneous ideal. Let $h(S/I,lambda)$ be the $h$-polynomial of $S/I$ and $s=mathrmdegh(S/I,lambda)$ the degree of $h(S/I,lambda)$. It follows that the inequality $s-rleqd-e$, where $r=mathrmreg(S/I)$, $d=dimS/I$ and $e=mathrmdepthS/I$, is satisfied and, in addition, the equality $s-r=d-e$ holds if and only if $S/I$ has a unique extremal Betti number. We are interested in finding a natural class of finite simple graphs $G$ for which $S/I(G)$, where $I(G)$ is the edge ideal of $G$, satisfies $s-r=d-e$. Let $a(S/I(G))$ denote the $a$-invariant of $S/I$, i.e., $a(S/I(G))=s-d$. One has $a(S/I(G))leq0$. In the present paper, by showing the fundamental fact that every Cameron--Walker graph $G$ satisfies $a(S/I(G))=0$, a class of Cameron--Walker graphs $G$ for which $S/I(G)$ satisfies $s-r=d-e$ will be exhibited.

Review text

Suppose that \(S=K[x_1, \dots, x_n]\) is the polynomial ring over the field \(K\) with standard grading and \(I\) is a homogeneous ideal of \(S\) with \(\dim (S/I)=d\). It is well known that the Hilbert series \(H(S/I,\lambda)\) of \(S/I\) is of the form \[H(S/I, \lambda)=\frac{h(S/I,\lambda)}{(1-\lambda)^d},\] where \(h(S/I, \lambda)\) is a polynomial in \(\mathbb{Z}[\lambda]\). It is known that for every square-free monomial ideal \(I\) of \(S\), \[a(S/I):=\deg h(S/I, \lambda)- \dim (S/I)\leq 0, \tag{1}\] and \[\deg h(S/I,\lambda)-\mathrm{reg} \ (S/I) \leq \dim (S/I) -\mathrm{depth} \ (S/I). \tag{2}\] On the other hand, A Cameron-Walker graph is a simple graph which is neither a star graph nor a star triangle and has the same matching number and induced matching number. A combinatorial structure for such graphs are introduced in [\textit{K. Cameron} and \textit{T. Walker}, Discrete Math. 299, 49--55 (2005; Zbl 1073.05054)]. In fact \(G\) is a Cameron-Walker graph if \(G\) consists of a connected bipartite graph with vertex partition \([n]\cup [m]\) such that at least one leaf edge attached to each vertex \(i\in [n]\) and that there may be possibly some pendant triangles attached to each vertex \(j\in[m]\). In the paper under review, the equalities in (1) and (2) are studied when \(I\) is the edge ideal of a Cameron-Walker graph. In fact it is shown that when \(I\) is the edge ideal of a Cameron-Walker graph, then \(a(S/I)=0\) and so \(\deg h(S/I, \lambda)= \dim (S/I)\). Also, this value is given in terms of the number of leaf edges and pendant triangles. So inequality (2) changes into \(\mathrm{reg} \ (S/I) \geq \mathrm{depth} \ (S/I)\). Since both of these invariants have combinatorial expression for these kinds of graphs, the authors can specify the Cameron-Walker graphs satisfying the equality in (2). They have also given an example of Cameron-Walker graph for which the inequality (2) is strict. As a corollary they have shown that for each \(2\leq e \leq d\) there are some Cameron-Walker graphs with \(\dim (S/I) =d\) and \(\mathrm{depth} \ (S/I)=e\). In addition, it is shown that when \(I\) is the edge ideal of the following graphs, equality in (2) holds: \begin{itemize} \item[\(\bullet\)] a star graph \(S_n\) with \(n\geq 1\); \item[\(\bullet\)] a path graph \(P_n\) with \(n\geq 2\); \item[\(\bullet\)] a cycle graph \(C_n\) with \(n\geq 3\); \item[\(\bullet\)] a broom graph \(B(n, 3)\) with \(n\geq 5\). \end{itemize} Although in [\textit{T. Hibi} et al., Electron. J. Comb. 26 (1) 1.22 (2019; Zbl 1440.13060)] it is shown that for given integers \(r, s \geq 1\), there exists a finite simple graph \(G\) such that \(\mathrm{reg} \ (S/I) = r\) and \(\deg h(S/I, \lambda) = s\), but in this paper the authors have shown that for Cameron-Walker graphs we always have \(\deg h(S/I, \lambda)\geq \mathrm{reg} \ (S/I) \) and the equality is precisely characterized. As the last but not least result, they have introduced some Cameron-Walker graphs with specified values for \(\dim (S/I), \mathrm{reg} \ (S/I)\) and \(\mathrm{depth} \ (S/I)\). The paper is well organized and the results are well explained with several illustrative examples.

Recommendations

• Homological invariants of Cameron-Walker graphs
• The regularity and h-polynomial of Cameron-Walker graphs
• Regularity, matchings and Cameron-Walker graphs
• Algebraic study on Cameron-Walker graphs
• Regularity and h-polynomials of monomial ideals

Cites work

• Algebraic study on Cameron-Walker graphs
• Betti Diagrams with Special Shape
• Bounds on the regularity and projective dimension of ideals associated to graphs
• Characteristic-independence of Betti numbers of graph ideals
• Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
• Depths of powers of the edge ideal of a tree
• Free resolutions of some edge ideals of simple graphs
• scientific article; zbMATH DE number 1194481 (Why is no real title available?)
• Matchings, coverings, and Castelnuovo-Mumford regularity
• Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers
• Non-vanishingness of Betti numbers of edge ideals
• On some invariants of a mixed product of ideals
• On the Stanley depth of the path ideal of a cycle graph
• Regularity and \(h\)-polynomials of edge ideals
• Regularity and h-polynomials of monomial ideals
• Regularity of powers of forests and cycles
• Regularity, depth and arithmetic rank of bipartite edge ideals
• Regularity, matchings and Cameron-Walker graphs
• Resolutions of Facet Ideals
• The graphs with maximum induced matching and maximum matching the same size
• Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity

Cited in

(15)

• An upper bound for the regularity of symbolic powers of edge ideals of chordal graphs
• Induced matching numbers of finite graphs and edge ideals
• Matchings and squarefree powers of edge ideals
• Regularity, matchings and Cameron-Walker graphs
• Regularity and h-polynomials of monomial ideals
• Algebraic study on Cameron-Walker graphs
• Homological invariants of Cameron-Walker graphs
• The regularity and h-polynomial of Cameron-Walker graphs
• Adjacency-like conditions and induced ideal graphs
• Induced matching, ordered matching and Castelnuovo-Mumford regularity of bipartite graphs
• The h-vectors of edge rings of odd cycle compositions
• On the three graph invariants related to matching of finite simple graphs
• Degree of h-polynomials of edge ideals
• The size of the Betti table of binomial edge ideals
• Postulation number of symbolic powers of certain two-dimensional monomial ideals

This page was built for publication: Regularity and \(a\)-invariant of Cameron-Walker graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2035829)