Related papers: Standard complexes of matroids and lattice paths
A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely related with many other topics in discrete mathematics, such…
An explicit lattice point realization is provided for the primary components of an arbitrary binomial ideal in characteristic zero. This decomposition is derived from a characteristic-free combinatorial description of certain primary…
It is known that there are finitely many simplicial complexes (up to isomorphism) with a given number of vertices. Translating to the language of $h$-vectors, there are finitely many simplicial complexes of bounded dimension with $h_1=k$…
We prove that the extension complexity of the independence polytope of every regular matroid on $n$ elements is $O(n^6)$. Past results of Wong and Martin on extended formulations of the spanning tree polytope of a graph imply a $O(n^2)$…
We consider three forms of composition of matroids, each of which extends the category of bimatroids to a rigid monoidal category. Many well-known constructions are functorial or defined by morphisms in these categories. Motivating examples…
We study the path realization of Demazure crystals related to solvable lattice models in statistical mechanics. Various characters are represented in a unified way as the sums over one dimensional configurations which we call unrestricted,…
It is shown that the lattices of flats of boolean representable simplicial complexes are always atomistic, but semimodular if and only if the complex is a matroid. A canonical construction is introduced for arbitrary finite atomistic…
We study point-line configurations, their minimal matroids, and their associated circuit varieties. We present an algorithm for identifying the minimal matroids of these configurations with respect to dependency order, or equivalently, the…
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…
A generalized complex structure is called stable if its defining anticanonical section vanishes transversally, on a codimension-two submanifold. Alternatively, it is a zero elliptic residue symplectic structure in the elliptic tangent…
The family of 2-level matroids, that is, matroids whose base polytope is 2-level, has been recently studied and characterized by means of combinatorial properties. 2-level matroids generalize series-parallel graphs, which have been already…
A recursion due to Kook expresses the Laplacian eigenvalues of a matroid M in terms of the eigenvalues of its deletion M-e and contraction M/e by a fixed element e, and an error term. We show that this error term is given simply by the…
We provide a characterisation of when a single-element contraction of a transversal matroid is itself transversal. Using this characterisation, we define a new class of transversal matroids closed under minors, which we call path-circular…
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 present a simple proof of the fact that the base (and independence) polytope of a rank $n$ regular matroid over $m$ elements has an extension complexity $O(mn)$.
We introduce dual matroids of 2-dimensional simplicial complexes. Under certain necessary conditions, duals matroids are used to characterise embeddability in 3-space in a way analogous to Whitney's planarity criterion. We further use dual…
We study paving matroids, their realization spaces, and their closures, along with matroid varieties and circuit varieties. Within this context, we introduce three distinct methods for generating polynomials within the associated ideals of…
A few years ago Kramer and Laubenbacher introduced a discrete notion of homotopy for simplicial complexes. In this paper, we compute the discrete fundamental group of the order complex of the Boolean lattice. As it turns out, it is…
Regular incidence complexes are combinatorial incidence structures generalizing regular convex polytopes, regular complex polytopes, various types of incidence geometries, and many other highly symmetric objects. The special case of…
We characterize conjugacy classes of isometries of odd prime order in unimodular Z-lattices. This is applied to give a complete classification of odd prime order non-symplectic automorphisms of irreducible holomorphic symplectic manifolds…