Related papers: A Pattern Avoidance Characterization for Smoothnes…
Two well-known polytopes whose vertices are indexed by permutations in the symmetric group $\mathfrak{S}_n$ are the permutohedron $P_n$ and the Birkhoff polytope $B_n$. We consider polytopes $P_n(\Pi)$ and $B_n(\Pi)$, whose vertices…
In this paper, we investigate pattern avoidance of parity restricted (even or odd) Grassmannian permutations for patterns of sizes 3 and 4. We use a combination of direct counting and bijective techniques to provide recurrence relations,…
The property of balance (in the sense of Feder and Mihail) is investigated in the context of paving matroids. The following examples are exhibited: (a) a class of ``sparse'' paving matroids that are balanced, but at the same time rich…
Matroids are often represented as oracles since there are no unified and compact representations for general matroids. This paper initiates the study of binary decision diagrams (BDDs) and zero-suppressed binary decision diagrams (ZDDs) as…
We study the moduli of G-local systems on smooth but not necessarily proper complex algebraic varieties. We show that, when suitably considered as derived algebraic stacks, they carry natural Poisson structures, generalizing the well known…
We use techniques from Gromov-Witten theory to construct new invariants of matroids taking value in the Chow groups of spaces of rational curves in the permutohedral toric variety. When the matroid is realizable by a complex hyperplane…
We introduce the Z-polynomial of a matroid, which we define in terms of the Kazhdan-Lusztig polynomial. We then exploit a symmetry of the Z-polynomial to derive a new recursion for Kazhdan-Lusztig coefficients. We solve this recursion,…
Given a matroid or flag of matroids we introduce several broad classes of polynomials satisfying Deletion-Contraction identities, and study their singularities. There are three main families of polynomials captured by our approach:…
We study a matrix-based notion of matroid representation over local commutative rings obtained by replacing linear independence with modular independence. This construction always defines an independence system, though not necessarily a…
We study the relationship between two notions of pattern avoidance for involutions in the symmetric group and their restriction to fixed-point-free involutions. The first is classical, while the second appears in the geometry of certain…
Matroids and semigraphoids are discrete structures abstracting and generalizing linear independence among vectors and conditional independence among random variables, respectively. Despite the different nature of conditional independence…
For all positive integers $\ell$ and $r$, we determine the maximum number of elements of a simple rank-$r$ positroid without the rank-$2$ uniform matroid $U_{2,\ell+2}$ as a minor, and characterize the matroids with the maximum number of…
In this paper we introduce discrete polymatroids satisfying the one-sided strong exchange property and show that they are sortable (as a consequence their base rings are Koszul) and that they satisfy White's conjecture. Since any pruned…
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…
Although algebraic matroids were discovered in the 1930s, interest in them was largely dormant until their recent use in applications of algebraic geometry. Because nonlinear algebra is computationally challenging, it is easier to work with…
We give a combinatorial characterization of generic frameworks that are minimally rigid under the additional constraint of maintaining symmetry with respect to a finite order rotation or a reflection. To establish these results we develop a…
A notion of branch-width, which generalizes the one known for graphs, can be defined for matroids. We first give a proof of the polynomial time model-checking of monadic second-order formulas on representable matroids of bounded…
In this paper we construct an explicit map from planar bicolored (plabic) trivalent graphs representing a given irreducible positroid cell $S$ in the totally non-negative Grassmannian $Gr^{\mbox{TNN}}(k,n)$ to the spectral data for the…
Permutations avoiding all patterns of a given shape (in the sense of Robinson-Schensted-Knuth) are considered. We show that the shapes of all such permutations are contained in a suitable thick hook, and deduce an exponential growth rate…
We exhibit a simple uniruledness criterion for general orthogonal modular varieties in terms of invariants of the corresponding lattice. As an application, we obtain the uniruledness of almost all Nikulin--Vinberg moduli spaces…