Related papers: Bergman Complexes of Lattice Path Matroids

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…

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$. Bonin et al. show that the lattice paths that go from $(0,0)$ to $(m,r)$ and remain bounded by $P$ and $Q$ can be…

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…

We introduce a new representation concept for lattices by boolean matrices, and utilize it to prove that any matroid is boolean representable. We show that such a representation can be easily extracted from a representation of the…

This article describes a natural piecewise Euclidean bi-simplicial cell structure for the space of $n$-element multisets in a fixed Euclidean rectangle. In particular, we highlight some connections with spaces of complex polynomials and…

We introduce decomposition complexes of posets, which generalize order complexes. The main advantage of our construction is that decomposition complexes are closed under taking products. Other special instances of this theory include nested…

We prove that if a simplicial complex is shellable, then the intersection lattice for the corresponding diagonal arrangement is homotopy equivalent to a wedge of spheres. Furthermore, we describe precisely the spheres in the wedge, based on…

We investigate an approach to matroid complexity that involves describing a matroid via a list of independent sets, bases, circuits, or some other family of subsets of the ground set. The computational complexity of algorithmic problems…

Tropical varieties play an important role in algebraic geometry. The Bergman complex B(M) and the positive Bergman complex B+(M) of an oriented matroid M generalize to matroids the notions of the tropical variety and positive tropical…

We introduce a concept of multiplicity lattices of 2-multiarrangements, determine the combinatorics and geometry of that lattice, and give a criterion and method to construct a basis for derivation modules effectively.

We introduce the notion of lattice path matroidal subdivisions, or LPM subdivisions for short, and show that these subdivisions are regular and hence the weight vectors for them lie in the Dressian. This leads us to explore the structure of…

We apply the homomorphism complex construction to partially ordered sets, introducing a new topological construction based on the set of maximal chains in a graded poset. Our primary objects of study are distributive lattices, with special…

This paper examines the structure of poset matrices by formulating a set of new construction rules for this purpose. In this direction, the technique of partial composition operation will be introduced as the basis for the construction of…

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…

Postnikov gave a combinatorial description of the cells in a totally-nonnegative Grassmannian. These cells correspond to a special class of matroids called positroid. We prove his conjecture that a positroid is exactly an intersection of…

A Littelmann path model is constructed for crystals pertaining to a not necessarily symmetrizable Borcherds-Cartan matrix. Here one must overcome several combinatorial problems coming from the imaginary simple roots. The main results are an…

A fundamental question for simplicial complexes is to find the lowest dimensional Euclidean space in which they can be embedded. We investigate this question for order complexes of posets. We show that order complexes of thick geometric…

We describe a "cellular" approach to the computation of the cohomology of a poset with coefficients in a presheaf. A cellular cochain complex is constructed, described explicitly and shown to compute the cohomology under certain…

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…

We introduce the concept of basis for a lattice. This basis plays a vital role to determine the completeness and consistency of the lattice. Weighted lattices are introduced and its complexity is formulated. Some axiomatic systems,…