Toric ideals generated by circuits
The authors consider normal toric rings defined by an ideal \(I\). A binomial in the polynomial ring \(K[T]\) is called balanced if the maximum of the exponents in each term are equal. It is called a connector if it has a square free term. A circuit in \(I\) is an irreducible binomial in \(I\), whose support is minimal with respect to inclusion. The main theorem is:NEWLINENEWLINEWith the above conditions, the following are equivalent:NEWLINENEWLINE(a) \(I\) is generated by a finite set of circuits.NEWLINENEWLINE(b) \(I\) is generated by a finite set of circuits with a square free term.NEWLINENEWLINE(c) Every unbalanced circuit of \(I\) has a connector which is a linear combination (with coefficients in \(K[T]\)) of circuits of \(I\) with a square free term.
- Constraints for the normality of monomial subrings and birationality
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- Introduction to Toric Varieties. (AM-131)
- On the normality of Rees algebras associated to totally unimodular matrices
- Polar syzygies in characteristic zero: The monomial case
- Properties of cut ideals associated to ring graphs
- Rees algebras of edge ideals
- Ring graphs and complete intersection toric ideals
- Ring graphs and toric ideals
- Set-theoretic complete intersections on binomials
- The circuit ideal of a vector configuration
- The integral closure of subrings associated to graphs
- A determinantal formula for circuits of integer lattices
- Linear codes over signed graphs
- On robustness and related properties on toric ideals
- Toric ideals and their circuits
- On complete intersection toric ideals of graphs
- Universally free numerical semigroups
- The circuit ideal of a vector configuration
- Generalized robust toric ideals
This page was built for publication: Toric ideals generated by circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2859253)