Regularity of the vanishing ideal over a parallel composition of paths
The aim of this paper is to compute the Castelnuovo-Mumford regularity of the toric ideal \(I(X)\) associated to a special class of graphs, namely 2-connected graphs with parallel ears, which can be constructed easily by ears: let \(C_1 \) be a cycle take two fixed vertices \(P_1,P_2\) in \(C_1 \) and add paths \(H_1,\dots,H_k\) with extremal vertices \(P_1,P_2\). The authors give a simple formula for the Castelnuovo-Mumford regularity \(I(X)\) in terms of the lengths of \(H_1,\dots,H_k\) and the number of elements of the finite base field \(K\). The proofs are rather technical.
- Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
- Bounds on the regularity of toric ideals of graphs
- Characteristic-independence of Betti numbers of graph ideals
- Graph theory
- scientific article; zbMATH DE number 5300021 (Why is no real title available?)
- scientific article; zbMATH DE number 1565322 (Why is no real title available?)
- Matchings, coverings, and Castelnuovo-Mumford regularity
- Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers
- On the regularity of binomial edge ideals
- Parameterized codes over some embedded sets and their applications to complete graphs
- Regularity and algebraic properties of certain lattice ideals
- Regularity bounds for binomial edge ideals
- The Castelnuovo-Mumford regularity of binomial edge ideals
- 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 complete multipartite graphs
- Vanishing Ideals Over Graphs and Even Cycles
- Degree and regularity of Eulerian ideals of hypergraphs
- Joins, ears and Castelnuovo-Mumford regularity
- Regularity of the vanishing ideal over a bipartite nested ear decomposition
- Vanishing ideals over complete multipartite graphs
- Betti numbers of toric algebras of certain bipartite graphs
- Parameterized codes over graphs
- The minimum distance of a parameterized code over an even cycle
This page was built for publication: Regularity of the vanishing ideal over a parallel composition of paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199715)