Related papers: Matroids over Skew Tracts
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].
The generators of the classical Specht module satisfy intricate relations. We introduce the Specht matroid, which keeps track of these relations, and the Specht polytope, which also keeps track of convexity relations. We establish basic…
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…
A recent line of research has concentrated on exploring the links between analytic and combinatorial theories of submodularity, uncovering several key connections between them. In this context, Lov\'asz initiated the study of matroids from…
A transduction provides us with a way of using the monadic second-order language of a structure to make statements about a derived structure. Any transduction induces a relation on the set of these structures. This article presents a…
A system of linear equations over a skew field has properties similar to properties of a system of linear equations over a field. Even noncommutativity of a product creates a new picture the properties of system of linear equations and of…
We extend the existing skew polynomial representations of matrix algebras which are direct sum of matrix spaces over division rings. In this representation, the sum-rank distance between two tuples of matrices is captured by a weight…
We give classifications of linear orbits of pairs of square matrices with non-vanishing discriminant polynomials over a field in terms of certain coherent sheaves with additional data on closed subschemes of the projective line. Our results…
We considered the possibility that the oriented matroid theory is connected with supersymmetry via the Grassmann-Plucker relations. The main reason for this, is that such relations arise in both in the chirotopes definition of an oriented…
We propose a novel definition of hypergraphical matroids, defined for arbitrary hypergraphs, simultaneously generalizing previous definitions for regular hypergraphs (Main, 1978), and for the hypergraphs of circuits of a matroid…
Hypergraphics matroids were studied first by Lorea and later by Frank et al. They can be seen as generalizations of graphic matroids. Here we show that several algorithms developed for the graphic case can be extended to hypergraphic…
The theory of matroids has been generalized to oriented matroids and, recently, to arithmetic matroids. We want to give a definition of "oriented arithmetic matroid" and prove some properties like the "uniqueness of orientation".
The introduction of covering-based rough sets has made a substantial contribution to the classical rough sets. However, many vital problems in rough sets, including attribution reduction, are NP-hard and therefore the algorithms for solving…
A mixed graph is a graph with some directed edges and some undirected edges. We introduce the notion of mixed matroids as a generalization of mixed graphs. A mixed matroid can be viewed as an oriented matroid in which the signs over a fixed…
We characterize 2-dimensional complexes associated canonically with basis graphs of matroids as simply connected triangle-square complexes satisfying some local conditions. This proves a version of a (disproved) conjecture by Stephen Maurer…
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…
Oriented matroids (often called order types) are combinatorial structures that generalize point configurations, vector configurations, hyperplane arrangements, polyhedra, linear programs, and directed graphs. Oriented matroids have played a…
We characterize the class of threshold matroids by the structure of their defining bases. We also give an example of a shifted matroid which is not threshold, answering a question of Deza and Onn. We conclude by exploring consequences of…
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…
The foundation of a matroid is a canonical algebraic invariant which classifies representations of the matroid up to rescaling equivalence. Foundations of matroids are pastures, a simultaneous generalization of partial fields and…