Related papers: Matroids over hyperfields
We establish a strong-weak coupling duality between two types of free matrix models. In the large-N limit, the real-symmetric matrix model is dual to the quaternionic-real matrix model. Using the large-N conformal invariant collective field…
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 extensions of hyperfields that generalizes the notion of field extensions. Since hyperfields have a multivalued addition, we must consider two kinds of extensions that we call weak hyperfield extensions and strong…
The family of 2-level matroids, that is, matroids whose base polytope is 2-level, has been recently studied and characterized by means of combinatorial properties. 2-level matroids generalize series-parallel graphs, which have been already…
Dowling and Rhodes defined different lattices on the set of triples (Subset, Partition, Cross Section) over a fixed finite group G. Although the Rhodes lattice is not a geometric lattice, it defines a matroid in the sense of the theory of…
An affine variety induces the structure of an algebraic matroid on the set of coordinates of the ambient space. The matroid has two natural decorations: a circuit polynomial attached to each circuit, and the degree of the projection map to…
The natural matroid of an integer polymatroid was introduced to show that a simple construction of integer polymatroids from matroids yields all integer polymatroids. As we illustrate, the natural matroid can shed much more light on integer…
A $q$-matroid is the analogue of a matroid which arises by replacing the finite ground set of a matroid with a finite-dimensional vector space over a finite field. These $q$-matroids are motivated by coding theory as the representable…
We develop a theory of representations of (discrete) polymatroids over tracts in terms of Pl\"ucker coordinates and suitable Pl\"ucker relations. As special cases, we recover polymatroids themselves as polymatroid representations over the…
Double field theory was developed by theoretical physicists as a way to encompass $T$-duality. In this paper, we express the basic notions of the theory in differential-geometric invariant terms, in the framework of para-Kaehler manifolds.…
In this paper we develop the theory of cyclic flats of $q$-matroids. We show that the lattice of cyclic flats, together with their ranks, uniquely determines a $q$-matroid and hence derive a new $q$-cryptomorphism. We introduce the notion…
A classification is given for (regular) positions of direct sums of two matroid algebras (unital algebraic limits of matrix algebras) in a matroid superalgebra, where the individual summands have index 2 in their associated corner algebra.…
We develop classical globally supersymmetric theories. As much as possible, we treat various dimensions and various amounts of supersymmetry in a uniform manner. We discuss theories both in components and in superspace. Throughout we…
This paper develops the basic theory of formal schemes over fields in the supersymmetric setting. We introduce the notion of a formal superscheme and investigate some of its fundamental properties. Particular emphasis is placed on the study…
Given a subgroup $\mathcal{H}$ of a product of finite groups $\mathcal{G} = \displaystyle\prod^n_{i=1} \Gamma_i$ and $b>1,$ we define a polymatroid $P(\mathcal{H},b).$ If all of the $\Gamma_i$ are isomorphic to $\mathbb{Z}/p\mathbb{Z},$ $p$…
Multimatroids generalize matroids, delta-matroids, and isotropic systems, and transition polynomials of multimatroids subsume various polynomials for these latter combinatorial structures, such as the interlace polynomial and the…
We define an independence system associated with simple graphs. We prove that the independence system is a matroid for certain families of graphs, including trees, with bases as minimal resolving sets. Consequently, the greedy algorithm on…
We discuss several extension properties of matroids and polymatroids and their application as necessary conditions for the existence of different matroid representations, namely linear, folded linear, algebraic, and entropic…
We construct a full embedding of the category of hyperfields into Dress's category of fuzzy rings and explicitly characterize the essential image --- it fails to be essentially surjective in a very minor way. This embedding provides an…
We investigate an approach to matroid complexity that involves describing a matroid via a list of independent sets, bases, circuits, or some other family of subsets of the ground set. The computational complexity of algorithmic problems…