activity
20062025
most citedMinimal Generating Sets of Lattice Ideals

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

collaborators

17 papers

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.AG2023

Self-dual toric varieties

Apostolos Thoma, Marius Vladoiu

We describe explicitly all multisets of weights whose defining projective toric varieties are self-dual. In addition, we describe a remarkable and unexpected combinatorial behaviou…

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.CO2022★ 1 cited

Asymptotic behavior of Markov complexity of matrices

Shmuel Onn, Apostolos Thoma, Marius Vladoiu

To any integer matrix one can associate a matroid structure consisting of a graph and another integer matrix . The connected components of this graph are called bouquets.…

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…