Related papers: Twist monomials of binary delta-matroids
In this paper we employ Tutte's theory of bridges to derive a decomposition theorem for binary matroids arising from signed graphs. The proposed decomposition differs from previous decomposition results on matroids that have appeared in the…
A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…
A Rota-Baxter operator defined on the polynomial algebra is called monomial if it maps each monomial to a monomial with some coefficient. We classify monomial Rota-Baxter operators defined on the algebra of polynomials in one variable…
In this article we make several contributions of independent interest. First, we introduce the notion of stressed hyperplane of a matroid, essentially a type of cyclic flat that permits to transition from a given matroid into another with…
The first author introduced the circuit-cocircuit reversal system of an oriented matroid, and showed that when the underlying matroid is regular, the cardinalities of such system and its variations are equal to special evaluations of the…
In the 1990s, Kita--Yoshida and Cho--Matsumoto introduced intersection forms on the twisted (co)homologies of hyperplane arrangement complements. We give a closed combinatorial formula for these intersection pairings. We show that these…
For a matroid $M$, an element $e$ such that both $M\backslash e$ and $M/e$ are regular is called a regular element of $M$. We determine completely the structure of non-regular matroids with at least two regular elements. Besides four small…
We study an operation in matroid theory that allows one to transition a given matroid into another with more bases via relaxing a \emph{stressed subset}. This framework provides a new combinatorial characterization of the class of split…
In this article, we present a simple criterion for checking whether a one-parameter matrix group of dilations admits a continuous wavelet. This criterion involves only checking that the eigenvalues of the symmetric part of the matrix have…
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 this short note we make a few remarks on a class of generalized incidence matrices whose matroids do not depend on the orientation of the underlying graph and natural commutative algebras associated to such matrices.
Ardila and Develin's paper on tropical oriented hyperplane arrangements and tropical oriented matroids defines tropical oriented matroids and conjectures a bijection between them and triangulations of products of simplices $\Delta_{n-1}…
The effect of replacing a basis element on the way the basis spans other elements is studied. This leads to a new characterization of binary matroids.
For an abelian group $\Gamma$, a $\Gamma$-labelled graph is a graph whose vertices are labelled by elements of $\Gamma$. We prove that a certain collection of edge sets of a $\Gamma$-labelled graph forms a delta-matroid, which we call a…
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…
Unimodular triangulations of lattice polytopes arise in algebraic geometry, commutative algebra, integer programming and, of course, combinatorics. In this article, we review several classes of polytopes that do have unimodular…
Motivated by Gr\"obner basis theory for finite point configurations, we define and study the class of "standard complexes" associated to a matroid. Standard complexes are certain subcomplexes of the independence complex that are invariant…
We establish a connection between the algebraic geometry of the type B permutohedral toric variety and the combinatorics of delta-matroids. Using this connection, we compute the volume and lattice point counts of type B generalized…
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…
We introduce a new group action on set systems, constructed as a semidirect product of a permutation group and a group generated by twist and loop complementation operations on a single element. This action extends the ribbon group…