Matroid theory provides a unifying framework for studying dependence across combinatorics, geometry, and applications ranging from rigidity to statistics. In this work, we study circuit varieties of matroids, defined by their minimal dependencies, which play a central role in modeling determinantal varieties, rigidity problems, and conditional independence relations. We introduce an efficient computational strategy for decomposing the circuit variety of a given matroid $M$, based on an algorithm that identifies its maximal degenerations. These degenerations correspond to the largest matroids lying below $M$ in the weak order. Our framework yields explicit and computable decompositions of circuit varieties that were previously out of reach for symbolic or numerical algebra systems. We apply our strategy to several classical configurations, including the Vámos matroid, the unique Steiner quadruple system $S(3,4,8)$, projective and affine planes, the dual of the Fano matroid, and the dual of the graphic matroid of $K_{3,3}$. In each case, we successfully compute the minimal irreducible decomposition of their circuit varieties.
We continue, generalize and expand our study of linear degenerations of flag varieties from [G. Cerulli Irelli, X. Fang, E. Feigin, G. Fourier, M. Reineke, Math. Z. 287 (2017), no. 1-2, 615-654]. We realize partial flag varieties as quiver Grassmannians for equi-oriented type A quivers and construct linear degenerations by varying the corresponding quiver representation. We prove that there exists the deepest flat degeneration and the deepest flat irreducible degeneration: the former is the partial analogue of the mf-degenerate flag variety and the latter coincides with the partial PBW-degener…
We study the combinatorial, algebraic and geometric properties of the free product operation on matroids. After giving cryptomorphic definitions of free product in terms of independent sets, bases, circuits, closure, flats and rank function, we show that free product, which is a noncommutative operation, is associative and respects matroid duality. The free product of matroids $M$ and $N$ is maximal with respect to the weak order among matroids having $M$ as a submatroid, with complementary contraction equal to $N$. Any minor of the free product of $M$ and $N$ is a free product of a repeated t…
We study the direct sum of q-matroids by way of their cyclic flats. Using that the rank function of a q-matroid is fully determined by the cyclic flats and their ranks, we show that the cyclic flats of the direct sum of two q-matroids are exactly all the direct sums of the cyclic flats of the two summands. This simplifies the rank function of the direct sum significantly. A q-matroid is called irreducible if it cannot be written as a (non-trivial) direct sum. We provide a characterization of irreducibility in terms of the cyclic flats and show that every q-matroid can be decomposed into a dire…
We construct a family of flat semitoric degenerations for the Hibi variety of every finite distributive lattice. The irreducible components of each degeneration are the toric varieties associated with polytopes forming a regular subdivision of the order polytope of the underlying poset. These components are themselves Hibi varieties. For each degeneration in our family we also define the corresponding weight polytope and embed the degeneration into the associated toric variety as the union of orbit closures given by a set of faces. Every such weight polytope projects onto the order polytope wi…
Let $\Fl_λ$ be a generalized flag variety of a simple Lie group $G$ embedded into the projectivization of an irreducible $G$-module $V_λ$. We define a flat degeneration $\Fl_λ^a$, which is a ${\mathbb G}^M_a$ variety. Moreover, there exists a larger group $G^a$ acting on $\Fl_λ^a$, which is a degeneration of the group $G$. The group $G^a$ contains ${\mathbb G}^M_a$ as a normal subgroup. If $G$ is of type $A$, then the degenerate flag varieties can be embedded into the product of Grassmanians and thus to the product of projective spaces. The defining ideal of $\Fl^a_λ$ is generated by the set o…
A classical problem in Distance Geometry, with multiple practical applications (in molecular structure determination, sensor network localization etc.) is to find the possible placements of the vertices of a graph with given edge lengths. For minimally rigid graphs, the double-exponential Gröbner Bases algorithm with an elimination order can be applied, in theory, but it is impractical even for small instances. By relating the problem to the computation of circuit polynomials in the Cayley-Menger ideal, we recently proposed an algebraic-combinatorial approach and an elimination algorithm for c…
Let $\SF^a_λ$ be the degenerate symplectic flag variety. These are projective singular irreducible $\bG_a^M$ degenerations of the classical flag varieties for symplectic group $Sp_{2n}$. We give an explicit construction for the varieties $\SF^a_λ$ and construct their desingularizations, similar to the Bott-Samelson resolutions in the classical case. We prove that $\SF^a_\la$ are normal locally complete intersections with terminal and rational singularities. We also show that these varieties are Frobenius split. Using the above mentioned results, we prove an analogue of the Borel-Weil-Bott theo…
The Dulmage--Mendelsohn decomposition (or the DM-decomposition) gives a unique partition of the vertex set of a bipartite graph reflecting the structure of all the maximum matchings therein. A bipartite graph is said to be DM-irreducible if its DM-decomposition consists of a single component. In this paper, we focus on the problem of making a given bipartite graph DM-irreducible by adding edges. When the input bipartite graph is balanced (i.e., both sides have the same number of vertices) and has a perfect matching, this problem is equivalent to making a directed graph strongly connected by ad…
A picture P of a graph G = (V,E) consists of a point P(v) for each vertex v in V and a line P(e) for each edge e in E, all lying in the projective plane over a field k and subject to containment conditions corresponding to incidence in G. A graph variety is an algebraic set whose points parametrize pictures of G. We consider three kinds of graph varieties: the picture space X(G) of all pictures, the picture variety V(G), an irreducible component of X(G) of dimension 2|V|, defined as the closure of the set of pictures on which all the P(v) are distinct, and the slope variety S(G), obtained by f…
