Related papers: Cryptomorphisms for abstract rigidity matroids
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…
Matroid theory provides a unifying framework for studying dependence across combinatorics, geometry, and applications ranging from rigidity to statistics. In this work, we study circuit varieties of matroids, defined by their minimal…
We observe an inductive structure in a large class of Artin groups and exploit this information to deduce the Farrell-Jones isomorphism conjecture for several classes of Artin groups of finite real, complex and affine types.
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…
Generalizing a well known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the nodes of T correspond to minors of M that are either 3-connected or circuits or cocircuits,…
We generalize the 1/3-2/3 conjecture from partially ordered sets to antimatroids: we conjecture that any antimatroid has a pair of elements x,y such that x has probability between 1/3 and 2/3 of appearing earlier than y in a uniformly…
Orbits of automorphism groups of partially ordered sets are not necessarily congruence classes, i.e. images of an order homomorphism. Based on so-called orbit categories a framework of factorisations and unfoldings is developed that…
We introduce a new width parameter for matroids called decomposition width and prove that every matroid property expressible in the monadic second order logic can be computed in linear time for matroids with bounded decomposition width if…
We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]
We characterize which systems of sign vectors are the cocircuits of an oriented matroid in terms of the cocircuit graph.
We present a comprehensive overview of Ardila and Develin's (generic) tropical oriented matroids, as well as many related objects and their axiomatics. Moreover, we use a unifying framework that elucidates the connections between these…
Matroids over tracts provide an algebraic framework simultaneously generalizing the notions of matroids, oriented matroids, and valuated matroids, presented by Baker and Bowler. Pendavingh partially extended this theory to skew hyperfields…
We consider the GF$(4)$-representable matroids with a circuit-hyperplane such that the matroid obtained by relaxing the circuit-hyperplane is also GF$(4)$-representable. We characterize the structure of these matroids as an application of…
We introduce the notion of a matroid M over a commutative ring R, assigning to every subset of the ground set an R-module according to some axioms. When R is a field, we recover matroids. When R=$\mathbb{Z}$, and when R is a DVR, we get…
B\'ar\'any, Kalai, and Meshulam recently obtained a topological Tverberg-type theorem for matroids, which guarantees multiple coincidences for continuous maps from a matroid complex to d-dimensional Euclidean space, if the matroid has…
To every realizable oriented matroid there corresponds an arrangement of real hyperplanes. The homeomorphism type of the complexified complement of such an arrangement is completely determined by the oriented matroid. In this paper we study…
Tropical oriented matroids were defined by Ardila and Develin in 2007. They are a tropical analogue of classical oriented matroids in the sense that they encode the properties of the types of points in an arrangement of tropical hyperplanes…
This study aims to shed light on new (sub)classes of matroids originating from cluster algebras and investigate their properties. We focus on what we call cluster matroids and build some results on them. Then, we point out a relationship…
The mathematical formalisms used to model biological systems induce both latent and ambiguous assumptions that can limit or distort their representational capabilities. Developing formalisms that can represent systems more precisely is…
Matroid varieties are the closures in the Grassmannian of sets of points defined by specifying which Pl\"ucker coordinates vanish and which don't --- the set of nonvanishing Pl\"ucker coordinates forms a well-studied object called a…