Toric ideals generated by circuits (Q2859253)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Toric ideals generated by circuits |
scientific article; zbMATH DE number 6223385
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Toric ideals generated by circuits |
scientific article; zbMATH DE number 6223385 |
Statements
7 November 2013
0 references
circuits
0 references
toric ideal
0 references
normal configuration
0 references
edge subring
0 references
multigraph
0 references
Toric ideals generated by circuits (English)
0 references
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.
0 references