Related papers: Matroids over Skew Tracts
This paper is a direct generalization of Baker-Bowler theory to flag matroids, including its moduli interpretation as developed by Baker and the second author for matroids. More explicitly, we extend the notion of flag matroids to flag…
One of the most important classes of even $\Delta$-matroids arises from orientable ribbon graphs, which play a role analogous to that of graphic matroids in matroid theory. Motivated by a natural correspondence between strong…
We develop a theory of representations of (discrete) polymatroids over tracts in terms of Pl\"ucker coordinates and suitable Pl\"ucker relations. As special cases, we recover polymatroids themselves as polymatroid representations over the…
A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…
At present, practical application and theoretical discussion of rough sets are two hot problems in computer science. The core concepts of rough set theory are upper and lower approximation operators based on equivalence relations. Matroid,…
We prove that every infinite sequence of skew-symmetric or symmetric matrices M_1, M_2, ... over a fixed finite field must have a pair M_i, M_j (i<j) such that M_i is isomorphic to a principal submatrix of the Schur complement of a…
DeVos, Kwon, and Oum introduced the concept of branch-depth of matroids as a natural analogue of tree-depth of graphs. They conjectured that a matroid of sufficiently large branch-depth contains the uniform matroid $U_{n,2n}$ or the cycle…
The theory of rough sets is concerned with the lower and upper approximations of objects through a binary relation on a universe. It has been applied to machine learning, knowledge discovery and data mining. The theory of matroids is a…
This note contributes to the structure theory of abstract rigidity matroids in general dimension. In the spirit of classical matroid theory, we prove several cryptomorphic characterizations of abstract rigidity matroids (in terms of…
B\'ar\'any, Kalai, and Meshulam recently obtained a topological Tverberg-type theorem for matroids, which guarantees multiple coincidences for continuous maps from a matroid complex to d-dimensional Euclidean space, if the matroid has…
Over a finite field $\mathbb{F}_{q^m}$, the evaluation of skew polynomials is intimately related to the evaluation of linearized polynomials. This connection allows one to relate the concept of polynomial independence defined for skew…
We introduce certain torus-equivariant classes on permutohedral varieties which we call "tautological classes of matroids" as a new geometric framework for studying matroids. Using this framework, we unify and extend many recent…
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…
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…
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…
In this paper, the structural controllability of the systems over F(z) is studied using a new mathematical method-matroids. Firstly, a vector matroid is defined over F(z). Secondly, the full rank conditions of [sI-A|B] are derived in terms…
We study realization spaces of matroids over hyperfields (in the sense of Baker and Bowler). More precisely, given a matroid M and a hyperfield H we determine the space of all H-matroids over M. This can be seen as the matroid stratum of…
In this paper we address two of the major foundational questions in the theory of matroids over rings. First, we provide a cryptomorphic axiomatisation, by introducing an analogue of the base polytope for matroids. Second, we describe a…
We explore a combinatorial theory of linear dependency in complex space, "complex matroids", with foundations analogous to those for oriented matroids. We give multiple equivalent axiomatizations of complex matroids, showing that this…
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…