activity
20062025
most citedMinimal Generating Sets of Lattice Ideals

9 citations · 18 across the 14 of their papers we have counts for

collaborators
Showing math.ACShow all

15 papers · 1 filter

math.AC2025

On the dimension of the strongly robust complex for configurations in general position

Dimitra Kosta, Apostolos Thoma, Marius Vladoiu

Strongly robust toric ideals are the toric ideals for which the set of indispensable binomials is the Graver basis. The strongly robust simplicial complex of a simple toric i…

math.AC2023

The strongly robust simplicial complex of monomial curves

Dimitra Kosta, Apostolos Thoma, Marius Vladoiu

To every simple toric ideal one can associate the strongly robust simplicial complex , which determines the strongly robust property for all ideals that have as th…

math.AC2022

On the strongly robustness property of toric ideals

Dimitra Kosta, Apostolos Thoma, Marius Vladoiu

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 ar…

math.AC2017

Hypergraph encodings of arbitrary toric ideals

Sonja Petrović, Apostolos Thoma, Marius Vladoiu

Relying on the combinatorial classification of toric ideals using their bouquet structure, we focus on toric ideals of hypergraphs and study how they relate to general toric ideals…

math.AC2015

Bouquet algebra of toric ideals

Sonja Petrović, Apostolos Thoma, Marius Vladoiu

To any toric ideal , encoded by an integer matrix , we associate a matroid structure called {\em the bouquet graph} of and introduce another toric ideal called {\em the…

math.AC2015

Binomial fibers and indispensable binomials

Hara Charalambous, Apostolos Thoma, Marius Vladoiu

Let be an arbitrary ideal generated by binomials. We show that certain equivalence classes of fibers are associated to any minimal binomial generating set of . We provide a…