On the strongly robustness property of toric ideals

TL;DR

This paper investigates the robustness properties of toric ideals by analyzing their bouquet structures and introduces a simplicial complex that characterizes strong robustness, especially in codimension 2 cases.

Contribution

It establishes that key combinatorial sets depend solely on bouquet types and introduces the strongly robustness simplicial complex to characterize robustness in toric ideals.

Findings

Cardinality of key sets depends only on bouquet types.

Introduces the strongly robustness simplicial complex.

Shows robustness implies strong robustness in codimension 2.

Abstract

To every toric ideal one can associate an oriented matroid structure, consisting of a graph and another toric ideal, called bouquet ideal. The connected components of this graph are called bouquets. Bouquets are of three types; free, mixed and non mixed. We prove that the cardinality of the following sets - the set of indispensable elements, minimal Markov bases, the Universal Markov basis and the Universal Gr\"obner basis of a toric ideal - depends only on the type of the bouquets and the bouquet ideal. These results enable us to introduce the strongly robustness simplicial complex and show that it determines the strongly robustness property. For codimension 2 toric ideals, we study the strongly robustness simplicial complex and prove that robustness implies strongly robustness.