Generalized robust toric ideals

DOI10.1016/J.JPAA.2015.06.009zbMATH Open1323.05067arXiv1503.00367OpenAlexW1570218345MaRDI QIDQ886980FDOQ886980

Authors: Christos Tatakis 

Publication date: 27 October 2015

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Abstract: An ideal I is robust if its universal Gr"obner basis is a minimal generating set for this ideal. In this paper, we generalize the meaning of robust ideals. An ideal is defined as generalized robust if its universal Gr"obner basis is equal to its universal Markov basis. This article consists of two parts. In the first one, we study the generalized robustness on toric ideals of a graph G. We prove that a toric graph ideal is generalized robust if and only if its universal Markov basis is equal to the Graver basis of the ideal. Furthermore, we give a graph theoretical characterization of generalized robust graph ideals, which is based on terms of graph theoretical properties of the circuits of the graph G. In the second part, we go on to describe the general case of toric ideals, in which we prove that a robust toric ideal has a unique minimal system of generators, or in other words, all of its minimal generators are indispensable.

Full work available at URL: https://arxiv.org/abs/1503.00367

Recommendations

• Robust graph ideals
• Minimal generators of toric ideals of graphs
• On robustness and related properties on toric ideals
• Robust toric ideals
• Strongly robust toric ideals in codimension 2

zbMATH Keywords

universal Markov basisrobust idealsuniversal Gröbner basis

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) 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) Paths and cycles (05C38)

Cites Work

• Introduction to Toric Varieties. (AM-131)
• Title not available (Why is that?)
• Toric ideals generalized by quadratic binomials
• On the Gröbner complexity of matrices
• A finiteness theorem for Markov bases of hierarchical models
• Rings of Invariants of Tori, Cohen-Macaulay Rings Generated by Monomials, and Polytopes
• Binomial ideals
• Nice initial complexes of some classical ideals
• Algebraic algorithms for sampling from conditional distributions
• Rees algebras of edge ideals
• Minimal generators of toric ideals of graphs
• INDISPENSABLE BINOMIALS OF FINITE GRAPHS
• Toric ideals generated by circuits
• On complete intersection toric ideals of graphs
• Minimal systems of binomial generators and the indispensable complex of a toric ideal
• On the universal Gröbner bases of toric ideals of graphs
• Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions
• Markov complexity of monomial curves
• Robust toric ideals
• Robust graph ideals
• Markov bases and generalized Lawrence liftings

Cited In (9)

• Universally free numerical semigroups
• On robustness and related properties on toric ideals
• Bouquet algebra of toric ideals
• Strongly robust toric ideals in codimension 2
• The closure of a linear space in a product of lines
• The strongly robust simplicial complex of monomial curves
• Robust toric ideals
• On the strongly robust property of toric ideals
• On the relative size of toric bases

Uses Software

• CoCoA

This page was built for publication: Generalized robust toric ideals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q886980)