Related papers: Symmetric Tensor Matroids, Dual Rigidity Matroids,…
For a ribbon graph $G$, let $\gamma(G)$ denote its Euler genus. Recently, Chen, Gross and Tucker [J. Algebraic Combin. 63 (2026) 13] derived a formula for the maximum partial-dual Euler-genus $\partial\gamma_M(G)$ of a ribbon graph $G$.…
In the lightcone frame, where the supermembrane theory and the Matrix model are strikingly similar, the equations of motion admit an elegant complexification in even dimensional spaces. Although the explicit rotational symmetry of the…
The mutually enriching relationship between graphs and matroids has motivated discoveries in both fields. In this paper, we exploit the similar relationship between embedded graphs and delta-matroids. There are well-known connections…
Matroids, particularly linear ones, have been a powerful tool in parameterized complexity for algorithms and kernelization. They have sped up or replaced dynamic programming. Delta-matroids generalize matroids by encapsulating structures…
We compare closed and rigid monoidal categories. Closedness is defined by the tensor product having a right adjoint: the internal hom functor. Rigidity, on the other hand, generalises the duality of finite-dimensional vector spaces. In the…
We construct a family of independent sets for finite, atomic, and graded lattices, extending the well-known cryptomorphism between geometric lattices and matroids. This construction leads to an embedding theorem into geometric lattices that…
A number of recent papers have studied when symmetry causes frameworks on a graph to become infinitesimally flexible, or stressed, and when it has no impact. A number of other recent papers have studied special classes of frameworks on…
Given $d$ row vectors of $n$ tropical numbers, $d<n$, the tropical Stiefel map constructs a version of their row space, whose Pl\"ucker coordinates are tropical determinants. We explicitly describe the fibers of this map. From the viewpoint…
We develop a theory of principal determinants and hypergeometric systems for realizable matroids. Our framework parallels the toric theory of Gel'fand, Kapranov, and Zelevinsky (GKZ), but with the combinatorics of matroids and their flats…
We introduce the intersection cohomology module of a matroid and prove that it satisfies Poincar\'e duality, the hard Lefschetz theorem, and the Hodge-Riemann relations. As applications, we obtain proofs of Dowling and Wilson's Top-Heavy…
The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regular matroids generalizes that of graphical matroids, and a…
We prove a rigidity theorem that shows that, under many circumstances, quasi-isometric embeddings of equal rank, higher rank symmetric spaces are close to isometric embeddings. We also produce some surprising examples of quasi-isometric…
In this paper we construct the supersymmetric tensor hierarchy of N=1, d=4 supergravity. We find some differences with the general bosonic construction of 4-dimensional gauged supergravities. The global symmetry group of N=1,d=4…
A flat cover is a collection of flats identifying the non-bases of a matroid. We introduce the notion of cover complexity, the minimal size of such a flat cover, as a measure for the complexity of a matroid, and present bounds on the number…
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…
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…
Networks are frequently studied algebraically through matrices. In this work, we show that networks may be studied in a more abstract level using results from the theory of matroids by establishing connections to networks by decomposition…
We construct some matroids that have a circuit and a cocircuit with infinite intersection. This answers a question of Bruhn, Diestel, Kriesell, Pendavingh and Wollan. It further shows that the axiom system for matroids proposed by Dress…
We propose various new 3d N=2 dualities exploiting their recently discovered connection to the duality relations for 2d free field CFT correlators. Most of the dualities involve, as the main building block, a quiver theory with monopole…
We investigate the line arrangement that results from intersecting d complete flags in C^n. We give a combinatorial description of the matroid T_{n,d} that keeps track of the linear dependence relations among these lines. We prove that the…