1 citations · 3 across the 12 of their papers we have counts for
6 papers · 1 filter
Lovász--Saks--Schrijver Ideals and the Irreducible Components of the Variety of Orthogonal Representations of a Graph
Emiliano Liwski
Given a finite simple graph and a positive integer , one can associate to the Lovász--Saks--Schrijver ideal , an ideal generated by quadratic polynomials comin…
Decomposing Conditional Independence Ideals with Hidden Variables: A Matroid-Theoretic Approach
Emiliano Liwski
We study a class of determinantal ideals arising from conditional independence (CI) statements with hidden variables. Such CI statements translate into determinantal conditions on…
The V-Number of Binomial Edge Ideals: Minimal Cuts and Cycle Graphs
Emiliano Liwski
The v-number of a graded ideal is an invariant recently introduced in the context of coding theory, particularly in the study of Reed--Muller-type codes. In this work, we study the…
Algebraic Geometry of Cactus, Pascal, and Pappus Matroids
Emiliano Liwski, Fatemeh Mohammadi, Lisa Vandebrouck
We study rank-three matroids, known as point-line configurations, and their associated matroid varieties, defined as the Zariski closures of their realization spaces. Our focus is…
Efficient Algorithms for Maximal Matroid Degenerations and Irreducible Decompositions of Circuit Varieties
Emiliano Liwski, Fatemeh Mohammadi, Rémi Prébet
Matroid theory provides a unifying framework for studying dependence across combinatorics, geometry, and applications ranging from rigidity to statistics. In this work, we study ci…
Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties
Emiliano Liwski, Fatemeh Mohammadi
We study point-line configurations, their minimal matroids, and their associated circuit varieties. We present an algorithm for identifying the minimal matroids of these configurat…