93 citations · 105 across the 11 of their papers we have counts for
8 papers · 1 filter
Learning a performance metric of Buchberger's algorithm
Jelena Mojsilović, Dylan Peifer, Sonja Petrović
What can be (machine) learned about the complexity of Buchberger's algorithm? Given a system of polynomials, Buchberger's algorithm computes a Gröbner basis of the ideal these poly…
Threaded Gröbner Bases: a Macaulay2 package
Sonja Petrović, Shahrzad Jamshidi Zelenberg
The complexity of Gröbner computations has inspired many improvements to Buchberger's algorithm over the years. Looking for further insights into the algorithm's performance, we of…
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…
Blow-up algebras, determinantal ideals, and Dedekind-Mertens-like formulas
Alberto Corso, Uwe Nagel, Sonja Petrović +1
We investigate Rees algebras and special fiber rings obtained by blowing up specialized Ferrers ideals. This class of monomial ideals includes strongly stable monomial ideals gener…
Graphical models in Macaulay2
Luis David García-Puente, Sonja Petrović, Seth Sullivant
The Macaulay2 package GraphicalModels contains algorithms for the algebraic study of graphical models associated to undirected, directed and mixed graphs, and associated collection…
Equality of Graver bases and universal Gröbner bases of colored partition identities
Tristram Bogart, Raymond Hemmecke, Sonja Petrović
Associated to any vector configuration A is a toric ideal encoded by vectors in the kernel of A. Each toric ideal has two special generating sets: the universal Gröbner basis and t…