Related papers: Geometric Shifts and Positroid Varieties
Enumeration of all combinatorial types of point configurations and polytopes is a fundamental problem in combinatorial geometry. Although many studies have been done, most of them are for 2-dimensional and non-degenerate cases. Finschi and…
Let G(d,n) denote the Grassmannian of d-planes in C^n and let T be the torus (C^*)^n/diag(C^*) which acts on G(d,n). Let x be a point of G(d,n) and let \bar{Tx} be the closure of the T-orbit through x. Then the class of the structure sheaf…
In the Grassmannian $Gr_{\mathbb{C}}(k,n)$ we have positroid varieties $\Pi_f$, each indexed by a bounded affine permutation $f$ and containing torus-fixed points $\lambda \in \Pi_f$. In this paper we consider the partially ordered set…
Positroids are families of matroids introduced by Postnikov in the study of non-negative Grassmannians. In particular, positroids enumerate a CW decomposition of the totally non-negative Grassmannian. Furthermore, Postnikov has identified…
A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…
While the intersection of the Grassmannian Bruhat decompositions for all coordinate flags is an intractable mess, the intersection of only the {\em cyclic shifts} of one Bruhat decomposition turns out to have many of the good properties of…
We introduce a family of spaces called critical varieties. Each critical variety is a subset of one of the positroid varieties in the Grassmannian. The combinatorics of positroid varieties is captured by the dimer model on a planar…
A positroid is a special case of a realizable matroid that arose from the study of the totally nonnegative part of the Grassmannian by Postnikov. In this paper, we study the facets of its matroid polytope and the independent set polytope.…
Inspired by Kontsevich's graphic orbifold Euler characteristic we define a virtual Euler characteristic for any finite set of isomorphism classes of matroids of rank $r$. Our main result provides a simple formula for the virtual Euler…
Oriented matroids (often called order types) are combinatorial structures that generalize point configurations, vector configurations, hyperplane arrangements, polyhedra, linear programs, and directed graphs. Oriented matroids have played a…
We introduce the families of solvable and nilpotent matroids, examining their realization spaces, closures, and associated matroid and circuit varieties. We study their realizability, as well as the irreducible decomposition of their…
This is both an expository and research paper where we advocate a systematic study of continuous analogues of finite partially ordered sets, convex polytopes, oriented matroids, arrangements of subspaces, finite simplicial complexes, and…
Let $\mathbb{G}(d,n)$ be the complex Grassmannian of affine $d$-planes in $n$-space. We study the problem of characterizing the set of algebraic subvarieties of $\mathbb{G}(d,n)$ invariant under the action of the maximal torus $T$ and…
While the intersection of the Grassmannian Bruhat decompositions for all coordinate flags is an intractable mess, the intersection of only the cyclic shifts of one Bruhat decomposition turns out to have many of the good properties of the…
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…
We study determinantal varieties from conditional independence models with hidden variables, focusing on their irreducible decompositions, dimensions, degrees, and Gr\"obner bases. Each variety encodes a collection of matroids, whose flats…
Positroids are matroids realizable by real matrices with all nonnegative maximal minors. They partition the ordered matroids into equivalence classes, called positroid envelope classes, by their Grassmann necklaces. We give an explicit…
A permutation is called covexillary if it avoids the pattern $3412$. We construct an open embedding of a covexillary matrix Schubert variety into a Grassmannian Schubert variety. As applications of this embedding, we show that the…
A positroid variety is an intersection of cyclically rotated Grassmannian Schubert varieties. Each graded piece of the homogeneous coordinate ring of a positroid variety is the intersection of cyclically rotated (rectangular) Demazure…
This dissertation presents new results on three different themes all related to matroid polytopes. First we investigate properties of Ehrhart polynomials of matroid polytopes, independence matroid polytopes, and polymatroids. We prove that…