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 …

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 …

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 …

Let M be a matroid without loops or coloops and let T (M; x, y) be its Tutte polynomial. In
1999 Merino and Welsh conjectured that max⁡(T (M; 2, 0), T (M; 0, 2))≥ T (M; 1, 1) holds for …

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 …

Abstract In [30], Tardos studied special delta-matroids obtained from sequences of Higgs
lifts; these are the full Higgs lift delta-matroids that we treat and around which all of our …

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 …

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 …

Generalized counting constraint satisfaction problems include Holant problems with
planarity restrictions; polynomial-time algorithms for such problems include matchgates and …

In this paper, we consider the problem of determining when two tensor networks are
equivalent under a heterogeneous change of basis. In particular, to a tensor (or string) …