Related papers: An Algorithmic Proof of the Piff--Welsh Theorem on…
A transversal matroid $M$ of rank $r$ on $[n]$ can be associated to a family of binary matrices corresponding to different presentations of $M$. We describe those matrices which arise from unique maximal presentations of size $r$- giving a…
Let M be a matroid representable over a (partial) field P and B a matrix representable over a sub-partial field P' of P. We say that B confines M to P' if, whenever a P-representation matrix A of M has a submatrix B, A is a scaled…
We prove that for every proper minor-closed class $M$ of matroids representable over a prime field, there exists a constant-competitive matroid secretary algorithm for the matroids in $M$. This result relies on the extremely powerful…
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…
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…
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…
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…
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…
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…
It has recently been shown that infinite matroids can be axiomatized in a way that is very similar to finite matroids and permits duality. This was previously thought impossible, since finitary infinite matroids must have non-finitary…
A frame template over a field $\mathbb F$ describes the precise way in which a given $\mathbb F$-representable matroid is close to being a frame matroid. Our main result determines the maximum-rank projective or affine geometry that is…
A tract $F$ is an algebraic structure where multiplication is defined but addition is only partially defined. They were introduced by Baker and Bowler as a unified framework to study generalisations of matroids, including oriented and…
The matroid parity (or matroid matching) problem, introduced as a common generalization of matching and matroid intersection problems, is so general that it requires an exponential number of oracle calls. Nevertheless, Lov\'asz (1980)…
Matroid theory is fundamentally connected with index coding and network coding problems. In fact, the reliance of linear index coding and network coding rates on the characteristic of a field has been demonstrated by using the two…
A notion of branch-width, which generalizes the one known for graphs, can be defined for matroids. We first give a proof of the polynomial time model-checking of monadic second-order formulas on representable matroids of bounded…
Blasiak verified a conjecture of White for graphic matroids by showing that the toric ideal of a graphic matroid is generated by quadrics. In this paper, we extend this result to frame matroids satisfying a linearity condition. Such classes…
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 show that the coefficients of the characteristic polynomial of a central hyperplane arrangement $\mathcal A$, coincide with the multidegrees of the Gauss map of a pencil of hypersurfaces naturally associated to $\mathcal A$. As a…
This paper compares skew-linear and multilinear matroid representations. These are matroids that are representable over division rings and (roughly speaking) invertible matrices, respectively. The main tool is the von Staudt construction,…
We show that a field extension $K\subseteq L$ in positive characteristic $p$ and elements $x_e\in L$ for $e\in E$ gives rise to a matroid $M^\sigma$ on ground set $E$ with coefficients in a certain skew hyperfield $L^\sigma$. This skew…