Related papers: Representations of torsion-free arithmetic matroid…
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…
Efficient deterministic algorithms to construct representations of lattice path matroids over finite fields are presented. They are built on known constructions of hierarchical secret sharing schemes, a recent characterization of…
In this paper we give a necessary and sufficient criterion for representability of a matroid over an algebraic closed field. This leads to an algorithm, based on an extension of Groebner Bases, in order to decide if a given matroid is…
We prove the torsion freeness of the decomposable Orlik--Solomon algebra of a simple matroid on ground set $[n]$. In the class of hypersolvable \& non-supersolvable complex hyperplane arrangements, the torsion freeness, in a certain degree,…
Matrix representations are a powerful tool for designing efficient algorithms for combinatorial optimization problems such as matching, and linear matroid intersection and parity. In this paper, we initiate the study of matrix…
This article is a survey of matroid theory aimed at algebraic geometers. Matroids are combinatorial abstractions of linear subspaces and hyperplane arrangements. Not all matroids come from linear subspaces; those that do are said to be…
We present a new direct proof of a topological representation theorem for oriented matroids in the general rank case. Our proof is based on an earlier rank 3 version. It uses hyperline sequences and the generalized Sch{\"o}nflies theorem.…
We introduce a new representation concept for lattices by boolean matrices, and utilize it to prove that any matroid is boolean representable. We show that such a representation can be easily extracted from a representation of the…
There is a one-to-one correspondence between geometric lattices and the intersection lattices of arrangements of homotopy spheres. When the arrangements are essential and fully partitioned, Zaslavsky's enumeration of the cells of the…
We introduce the notion of an arithmetic matroid, whose main example is given by a list of elements of a finitely generated abelian group. In particular we study the representability of its dual, providing an extension of the Gale duality…
This article studies two notions of generalized matroid representations motivated by algorithmic information theory and cryptographic secret sharing. The first (entropic representability) involves discrete random variables, while the second…
We show algorithms for computing representative families for matroid intersections and use them in fixed-parameter algorithms for set packing, set covering, and facility location problems with multiple matroid constraints. We complement our…
There exist several theorems which state that when a matroid is representable over distinct fields F_1,...,F_k, it is also representable over other fields. We prove a theorem, the Lift Theorem, that implies many of these results. First,…
We study weight posets of weight multiplicity free (=wmf) representations $R$ of reductive Lie algebras. Specifically, we are interested in relations between $\dim R$ and the number of edges in the Hasse diagram of the corresponding weight…
A matroid $M$ is an ordered pair $(E,I)$, where $E$ is a finite set called the ground set and a collection $I\subset 2^{E}$ called the independent sets which satisfy the conditions: (i) $\emptyset \in I$, (ii) $I'\subset I \in I$ implies…
We present a new type of equivalence for representable matroids that uses the automorphisms of the underlying matroid. Two $r\times n$ matrices $A$ and $A'$ representing the same matroid $M$ over a field $F$ are {\it geometrically…
We show that the integral cohomology algebra of the complement of a toric arrangement is not determined by the poset of layers. Moreover, the rational cohomology algebra is not determined by the arithmetic matroid (however it is determined…
We construct minimal cellular resolutions of squarefree monomial ideals arising from hyperplane arrangements, matroids and oriented matroids. These are Stanley-Reisner ideals of complexes of independent sets, and of triangulations of…
In this paper, we introduce the problem of Matroid-Constrained Vertex Cover: given a graph with weights on the edges and a matroid imposed on the vertices, our problem is to choose a subset of vertices that is independent in the matroid,…
A representation theorem for non-semibounded Hermitian quadratic forms in terms of a (non-semibounded) self-adjoint operator is proven. The main assumptions are closability of the Hermitian quadratic form, the direct integral structure of…