Joins, ears and Castelnuovo-Mumford regularity
From MaRDI portal
Publication:2193192
Abstract: We introduce a new class of polynomial ideals associated to a simple graph, . Let be the polynomial ring on the edges of and the polynomial ring on the vertices of . We associate to an ideal, , defined as the preimage of by the map which sends a variable, , associated to an edge , to the product of the variables associated to its vertices. We show that is a one-dimensional, Cohen-Macaulay, graded ring, that is a binomial ideal and that, with respect to a fixed monomial order, its initial ideal has a generating set independent of the field . We focus on the Castelnuovo-Mumford regularity of providing the following sharp upper and lower bounds: mu(G) leq operatorname{reg} I(X_G) leq |V_G|-b_0(G)+1, where is the maximum vertex join number of the graph and is the number of its connected components. We show that the lower bound is attained for a bipartite graph and use this to derive a new combinatorial result on the number of even length ears of nested ear decomposition.
Recommendations
Cites work
- scientific article; zbMATH DE number 5300021 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
- Algebraic properties of toric rings of graphs
- Algebraic study on Cameron-Walker graphs
- Binomial edge ideals of regularity 3
- Bounds on the regularity of toric ideals of graphs
- Characteristic-independence of Betti numbers of graph ideals
- Conservative weightings and ear-decompositions of graphs
- Dominating induced matchings of finite graphs and regularity of edge ideals
- Improved bounds for the regularity of edge ideals of graphs
- Matchings, coverings, and Castelnuovo-Mumford regularity
- Monomial algebras
- Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers
- On the binomial edge ideal of a pair of graphs
- On the regularity of binomial edge ideals
- On the sequentially Cohen-Macaulay properties of almost complete multipartite graphs
- Parallel recognition of series-parallel graphs
- Parameterized codes over some embedded sets and their applications to complete graphs
- Regularity and algebraic properties of certain lattice ideals
- Regularity and projective dimension of the edge ideal of $C_5$-free vertex decomposable graphs
- Regularity bounds for binomial edge ideals
- Regularity of powers of forests and cycles
- Regularity of the vanishing ideal over a bipartite nested ear decomposition
- Regularity of the vanishing ideal over a parallel composition of paths
- Sequentially Cohen-Macaulay bipartite graphs: Vertex decomposability and regularity
- The Castelnuovo-Mumford regularity of binomial edge ideals
- The Geometry of Syzygies
- The covering radius of the cycle code of a graph
- The degree and regularity of vanishing ideals of algebraic toric sets over finite fields
- The minimum distance of parameterized codes on projective tori
- Vanishing Ideals Over Graphs and Even Cycles
- Vanishing ideals over complete multipartite graphs
- Vertex decomposability and regularity of very well-covered graphs
Cited in
(7)- Regularity of the vanishing ideal over a bipartite nested ear decomposition
- Castelnuovo-Mumford regularity under reduction processes on graphs and hypergraphs
- On the socle of Artinian algebras associated with graphs
- Eulerian ideals
- Parameterized codes over graphs
- Degree and regularity of Eulerian ideals of hypergraphs
- Regularity of the vanishing ideal over a parallel composition of paths
This page was built for publication: Joins, ears and Castelnuovo-Mumford regularity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2193192)