Related papers: Lattice Path Matroids: Structural Properties
The structure of the category of matroids and strong maps is investigated: it has coproducts and equalizers, but not products or coequalizers; there are functors from the categories of graphs and vector spaces, the latter being faithful;…
Nested matroids were introduced by Crapo in 1965 and have appeared frequently in the literature since then. A flat of a matroid $M$ is Hamiltonian if it has a spanning circuit. A matroid $M$ is nested if and only if its Hamiltonian flats…
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…
In this paper, we introduce the terminology of matroids into the study of Zariski-pairs related to rational elliptic surfaces, aiming to simplify the presentation and arguments involved. As an application, we provide new examples of Zariski…
Motivated by the characterization of the lattice of cyclic flats of a matroid, the convolution of a ranked lattice and a discrete measure is defined, generalizing polymatroid convolution. Using the convolution technique we prove that if a…
The introduction of covering-based rough sets has made a substantial contribution to the classical rough sets. However, many vital problems in rough sets, including attribution reduction, are NP-hard and therefore the algorithms for solving…
We call a class $\mathcal{M}$ of matroids hereditary if it is closed under flats. We denote by $\mathcal{M}^{ext}$ the class of matroids $M$ that is in $\mathcal{M}$, or has an element $e$ such that $M \backslash e$ is in $\mathcal{M}$. We…
In this paper, we propose a new type of matroids, namely covering matroids, and investigate the connections with the second type of covering-based rough sets and some existing special matroids. Firstly, as an extension of partitions,…
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…
Thin sums matroids were introduced to extend the notion of representability to non-finitary matroids. We give a new criterion for testing when the thin sums construction gives a matroid. We show that thin sums matroids over thin families…
We provide evidence for five long-standing, basis-exchange conjectures for matroids by proving them for the enormous class of sparse paving matroids. We also explore the role that these matroids may play in the following problem: as a…
A small fraction of all protein structures characterized so far are entangled. The challenge of understanding the properties of these knotted proteins, and the why and the how of their natural folding process, has been taken up in the past…
A flag matroid can be viewed as a chain of matroids linked by quotients. Flag matroids, of which relatively few interesting families have previously been known, are a particular class of Coxeter matroids. In this paper we give a family of…
Contraction$^*$-depth is considered to be one of the analogues of graph tree-depth in the matroid setting. In this paper, we investigate structural properties of contraction$^*$-depth of matroids representable over finite fields and…
A class of matroids is introduced which is very large as it strictly contains all paving matroids as special cases. As their key feature these split matroids can be studied via techniques from polyhedral geometry. It turns out that the…
Rough sets are efficient for data pre-process in data mining. Lower and upper approximations are two core concepts of rough sets. This paper studies generalized rough sets based on symmetric and transitive relations from the…
In this paper we develop the theory of cyclic flats of $q$-matroids. We show that the lattice of cyclic flats, together with their ranks, uniquely determines a $q$-matroid and hence derive a new $q$-cryptomorphism. We introduce the notion…
Based on the notion of vectors and linear subspaces for a matroid, we develop a theory of flats and hyperplane arrangements for T-matroids, where T is a tract. This leads to several cryptomorphic descriptions of T-matroids: in terms of its…
Lattices induced by coverings arise naturally in matroid theory and combinatorial optimization, providing a structured framework for analyzing relationships between independent sets and closures. In this paper, we explore the structural…
It is well known that the class of transversal matroids is not closed under contraction or duality. In particular, after contracting a set of elements from a transversal matroid, the resulting matroid may or may not be transversal, and the…