Lattice Path Delta Matroids

Abstract

We initiate the study of a type Cn generalization of the lattice path matroids defined by Bonin, de Mier, and Noy. These are delta matroids whose feasible sets are in bijection with lattice paths which are symmetric along the main diagonal. We describe deletion, contraction, enveloping matroids, and the homogeneous components of these delta matroids in terms of the combinatorics of symmetric lattice paths. In the second half, we study the convex geometry of the feasible polytopes of lattice path delta matroids. We show that these polytopes decompose into the feasible polytope of special lattice paths corresponding to intervals in the type Cn Gale order whose related Richardson variety is a toric variety. Further, these special polytopes inherit a unimodular triangulation from Stanley's Eulerian triangulation of the hypercube. As a consequence, the volume of these polytopes is the proportion of permutations with specific ascent sets.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…