Related papers: Lattice Path Matroid Polytopes

Fix two lattice paths P and Q from (0,0) to (m,r) that use East and North steps with P never going above Q. We show that the lattice paths that go from (0,0) to (m,r) and that remain in the region bounded by P and Q can be identified with…

A lattice path matroid is a transversal matroid corresponding to a pair of lattice paths on the plane. A matroid base polytope is the polytope whose vertices are the incidence vectors of the bases of the given matroid. In this paper, we…

In this paper we investigate the number of integer points lying in dilations of lattice path matroid polytopes. We give a characterization of such points as polygonal paths in the diagram of the lattice path matroid. Furthermore, we prove…

We introduce the minor-closed, dual-closed class of multi-path matroids. We give a polynomial-time algorithm for computing the Tutte polynomial of a multi-path matroid, we describe their basis activities, and we prove some basic structural…

We initiate the study of a type $C_n$ 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…

It is known that a lattice path matroid polytope can be associated with two given noncrossing lattice paths on $\mathbb{Z}\times\mathbb{Z}$ with the same end points. In this short note we give explicit formulae for the $f$-vector, toric…

This paper studies structural aspects of lattice path matroids, a class of transversal matroids that is closed under taking minors and duals. Among the basic topics treated are direct sums, duals, minors, circuits, and connected flats. One…

We characterize the quotients among lattice path matroids (LPMs) in terms of their diagrams. This characterization allows us to show that ordering LPMs by quotients yields a graded poset, whose rank polynomial has the Narayana numbers as…

For a lattice polytope $P$, the rank of $P$ is defined by $F-(\dim P+1)$, where $F$ is the number of facets of $P$. In this paper, we study matroid polytopes with small rank. More precisely, we characterize matroid independence polytopes…

Efficient deterministic algorithms to construct representations of lattice path matroids over finite fields are presented. They are built on known constructions of hierarchical secret sharing schemes, a recent characterization of…

The configuration of a matroid $M$ is the abstract lattice of cyclic flats (flats that are unions of circuits) where we record the size and rank of each cyclic flat, but not the set. One can compute the Tutte polynomial of $M$, and stronger…

Lattice path matroids and bicircular matroids are two well-known classes of transversal matroids. In the seminal work of Bonin and de Mier about structural properties of lattice path matroids, the authors claimed that lattice path matroids…

Matroids give rise to several natural constructions of polytopes. Inspired by this, we examine polytopes that arise from the signed circuits of an oriented matroid. We give the dimensions of these polytopes arising from graphical oriented…

There has been wide interest in understanding which properties of base graphs of matroids extend to base-cobase graphs of matroids. A significant result of Naddef and Pulleyblank (1984) shows that the $1$-skeleton of any $(0,1)$-polytope is…

A lattice path matroid is a transversal matroid for which some collection of incomparable intervals in some linear order on the ground set is a presentation. We characterize the minor-closed class of lattice path matroids by its excluded…

In this paper, we study positroids and its overlap with two classes of matroids: transversal and paving matroids. We exhibit a new class of fundamental transversal matroids and classify the Le-diagram for rank two transversal positroids. We…

We characterize the edges of two classes of $0/1$-polytopes. The first class corresponds to the stable set polytope of a graph $G$ and includes chain polytopes of posets, some instances of matroid independence polytopes, as well as…

We study lattice path matroid polytopes using their alcoved triangulation. We characterize Gorenstein lattice path matroid polytopes, yielding a new class of matroids satisfying the unimodality conjecture of de Loera, Haws, and K{\"o}ppe.…

We specify what is meant for a polytope to be reconstructible from its graph or dual graph. And we introduce the problem of class reconstructibility, i.e., the face lattice of the polytope can be determined from the (dual) graph within a…

It is possible to write the indicator function of any matroid polytope as an integer combination of indicator functions of Schubert matroid polytopes. In this way, every matroid on $n$ elements of rank $r$ can be thought of as a lattice…