Related papers: Positively oriented matroids are realizable

Let M be a closed simply connected n-manifold of positive sectional curvature. We determine its homeomorphism or homotopic type if M also admits an isometric elementary p-group action of large rank. Our main results are: There exists a…

We describe a bijection between oriented cubes and adjoints of cross-polytopes. This correspondence is used to prove that the real affine cube is, up to reorientation in the same class, the unique oriented cube that is realizable. Moreover,…

We present two characterizations of regular matroids among orientable matroids and use them to give a measure of "how far" an orientable matroid is from being regular.

Eventually positive matrices are real matrices whose powers become and remain strictly positive. As such, eventually positive matrices are a fortiori matrix roots of positive matrices, which motivates us to study the matrix roots of…

Let $r \leqslant n$ be nonnegative integers, and let $N = \binom{n}{r} - 1$. For a matroid $M$ of rank $r$ on the finite set $E = [n]$ and a partial field $k$ in the sense of Semple--Whittle, it is known that the following are equivalent:…

We develop the theory of matroids over one-dimensional algebraic groups, with special emphasis on positive characteristic. In particular, we compute the Lindstr\"om valuations and Frobenius flocks of such matroids. Building on work by Evans…

For any cluster-tilting object $\mathsf{T}$ in the cluster category $\mathscr{C}_{n}$ of type $\mathbb{A}_{n}$, we construct a rank-four oriented matroid $\mathcal{M}_{\mathsf{T}}$ such that stackable triangulations of…

This paper investigates infinite matroids from a categorical perspective. We prove that the category of infinite matroids is a proto-exact category in the sense of Dyckerhoff and Kapranov, thereby generalizing our previous result on the…

Antimatroids were discovered by Dilworth in the context of lattices [4] and introduced by Edelman and Jamison as convex geometries in[5]. The author of the current paper independently discovered (possibly infinite) antimatroids in the…

The Topological Representation Theorem for (oriented) matroids states that every (oriented) matroid can be realized as the intersection lattice of an arrangement of codimension one homotopy spheres on a homotopy sphere. In this paper, we…

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 paper, we investigate the relation between a $q$-matroid and its associated matroid called the projectivization matroid. The latter arises by projectivizing the groundspace of the $q$-matroid and considering the projective space as…

Seymour's decomposition theorem is a hallmark result in matroid theory presenting a structural characterization of the class of regular matroids. Formalization of matroid theory faces many challenges, most importantly that only a limited…

We explore novel connections between antimatroids and matchings in bipartite graphs. In particular, we prove that a combinatorial structure induced by stable matchings or maximum-weight matchings is an antimatroid. Moreover, we demonstrate…

Using the framework of pastures and foundations of matroids developed by Baker-Lorscheid, we give algorithms to: (i) compute the foundation of a matroid, and (ii) compute all morphisms between two pastures. Together, these provide an…

We initiate the study of a class of polytopes, which we coin polypositroids, defined to be those polytopes that are simultaneously generalized permutohedra (or polymatroids) and alcoved polytopes. Whereas positroids are the matroids arising…

This note generalizes a result contained in a previous paper [ J. Sanders, Circuit preserving edge maps II, J. Combin. Theory Ser. B 42 (1987), 146-155].

We study matroidal networks introduced by Dougherty et al. We prove the converse of the following theorem: If a network is scalar-linearly solvable over some finite field, then the network is a matroidal network associated with a…

In 1980, Las Vergnas defined a notion of discrete convexity for oriented matroids, which Edelman subsequently related to the theory of anti-exchange closure functions and convex geometries. In this paper, we use generalized matroid activity…

Finite matroids are combinatorial structures that express the concept of linear independence. In 1964, G.-C. Rota conjectured that the coefficients of the "characteristic polynomial" of a matroid $M$, polynomial whose coefficients enumerate…