Related papers: On two classes of nearly binary matroids
We consider an almost o-minimal expansion of an ordered group $\mathcal M=(M,<,+,0,\ldots)$ and its tame extension $\mathcal N=(N,<,+,0,\ldots)$. We demonstrate that the subset $\{x \in M^n\;|\; \mathcal N \models \Phi(x,a)\}$ of $M^n$…
Over fields of characteristic zero, we construct equivalences between certain categories of bialgebras which are generated by grouplikes and generalized primitives, and certain categories of structured Lie algebras. The relevant families of…
Seymour's Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped that…
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…
A characterization of the minimal $\mathcal{W}$-algebras associated with the Deligne exceptional series at level $-h^\vee/6$ is obtained by using one-parameter family of modular linear differential equations of order $4$. In particular, the…
This is an introductory paper about the category of regular oriented matroids (ROMs). We compare the homotopy types of the categories of regular and binary matroids. For example, in the unoriented case, they have the same fundamental group…
Inspired by a recent result of Brakensiek et al. that symmetric tensor matroids and rigidity matroids are linked by matroid duality, we define abstract symmetric tensor matroids as a dual concept to abstract rigidity matroids and establish…
In the present paper, we provide a cohomology group as a categorification of the characteristic polynomial of matroids. The construction depends on the ``quasi-representation'' of a matroid. For a certain choice of the quasi-representation,…
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…
An intertwine of a pair of matroids is a matroid such that it, but none of its proper minors, has minors that are isomorphic to each matroid in the pair. For pairs for which neither matroid can be obtained, up to isomorphism, from the other…
For each integer $n \geq 2$, we prove that, if $M$ is a simple rank-$r$ $PG(n-1,2)$-free binary matroid with $|M|>\left(1-\frac{3}{2^n}\right)2^r$, then there is a triangle-free corank-$(n-2)$ flat of $M$.
It is known that there exist hyperplane arrangements with same underlying matroid that admit non-homotopy equivalent complement manifolds. In this work we show that, in any rank, complex central hyperplane arrangements with up to 7…
A classification scheme of the conformal almost contact metric manifolds with respect to the covariant derivative of the Lee form is given. The subclasses of one basic class and their exact characterizations by the maximal subgroups of the…
We introduce the notion of an online matroid embedding, which is an algorithm for mapping an unknown matroid that is revealed in an online fashion to a larger-but-known matroid. We establish the existence of such an embedding for binary…
We provide a full classification of all families of matroids that are closed under duality and minors, and for which the Tutte polynomial is a universal valuative invariant. There are four inclusion-wise maximal families, two of which are…
We study a matrix-based notion of matroid representation over local commutative rings obtained by replacing linear independence with modular independence. This construction always defines an independence system, though not necessarily a…
We investigate the existence of heavy columns in binary matrices with distinct rows. A column of an m x n binary matrix is called heavy if the number of ones in it is at least m/2. We introduce two recursive algorithms, A1 and A2, that…
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…
The way circuits, relative to a basis, are affected as a result of exchanging a basis element, is studied. As consequences, it is shown that three consecutive symmetric exchanges exist for any two bases of a matroid, and that a full serial…
A simple binary matroid is called $I_4$-free if none of its rank-4 flats are independent sets. These objects can be equivalently defined as the sets $E$ of points in $PG(n-1,2)$ for which $|E \cap F|$ is not a basis of $F$ for any…