Binomial edge ideals with quadratic Gröbner bases
From MaRDI portal
(Redirected from Publication:648403)
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Combinatorial aspects of simplicial complexes (05E45) Structure, classification theorems for modules and ideals in commutative rings (13C05) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)
Abstract: Let be a simple graph on the vertex set and edge ideal . We consider the class of closed graphs. A closed graph is a simple graph satisfying the following property: for all edges and with and one has if , and if . We state some criteria for the closedness of a graph that do not depend necessarily from the labelling of its vertex set. Consequently, if is a polynomial ring in variables with coefficients in a field , we obtain some criteria for the Koszulness of the quotient algebra , where is the binomial edge ideal of i.e. the ideal generated by the binomials such that and is an edge of (cite{HH}).
Recommendations
Cited in
(21)- Binomial edge ideals: a survey
- Rees algebra and special fiber ring of binomial edge ideals of closed graphs
- The universal Gröbner basis of a binomial edge ideal
- Many toric ideals generated by quadratic binomials possess no quadratic Gröbner bases
- Binomial edge ideals with pure resolutions
- Sequentially Cohen-Macaulay binomial edge ideals of closed graphs
- On the regularity of binomial edge ideals
- The binomial edge ideal of a pair of graphs
- Regularity of binomial edge ideals of certain block graphs
- On \(m\)-closed graphs
- On the extremal Betti numbers of binomial edge ideals of block graphs
- Simple polytopes arising from finite graphs
- Binomial edge ideals and conditional independence statements
- Weakly closed graphs and \(F\)-purity of binomial edge ideals
- Closed binomial edge ideals
- Powers of binomial edge ideals with quadratic Gröbner bases
- Binomial Edge Ideals of Weakly Closed Graphs
- Gorenstein binomial edge ideals
- Lexicographic and reverse lexicographic quadratic Gröbner bases of cut ideals
- Linear flags and Koszul filtrations
- Koszul binomial edge ideals of pairs of graphs
This page was built for publication: Binomial edge ideals with quadratic Gröbner bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648403)