Related papers: The Varchenko Determinant for Oriented Matroids
We generalize the (signed) Varchenko matrix of a hyperplane arrangement to complexes of oriented matroids and show that its determinant has a nice factorization. This extends previous results on hyperplane arrangements and oriented…
The construction of the Varchenko matrix for hyperplane arrangements, first introduced by Alexandre Varchenko, extends naturally to oriented matroids. In this paper, we generalize the theorem of Gao and Zhang by proving that the Varchenko…
This work builds on Varchenko et al's introduction of bilinear forms for hyperplane arrangements, where the determinant of the associated matrices factorizes into simple components. While one of the determinant formula developed by…
The Varchenko determinant is the determinant of a matrix defined from an arrangement of hyperplanes. Varchenko proved that this determinant has a beautiful factorization. It is, however, not possible to use this factorization to compute a…
This article computes the Varchenko determinant of dehyperplane arrangements which are generalizations of pseudohyperplane arrangements. But unlike those latter, they are defined on a real manifold, and it is not always possible to obtain a…
Varchenko defined the Varchenko matrix associated to any real hyperplane arrangement and computed its determinant. In this paper, we show that the Varchenko matrix of a hyperplane arrangement has a diagonal form if and only if it is…
The Varchenko matrix is known to have a well-structured determinant for complexes of oriented matroids (COMs). COMs can be characterized as partial cubes that do not have certain forbidden pc-minors. In this work, we generalize the…
Varchenko introduced a distance function on chambers of hyperplane arrangements that he called quantum bilinear form. That gave rise to a determinant indexed by chambers whose entry in position $(C,D)$ is the distance between $C$ and $D$:…
The Varchenko determinant is the determinant of the bilinear form associated to a real hyperplane arrangement. We show that we can obtain the exact value of this determinant for certain hyperplane arrangements if we know the edges which are…
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".
We develop a theory of principal determinants and hypergeometric systems for realizable matroids. Our framework parallels the toric theory of Gel'fand, Kapranov, and Zelevinsky (GKZ), but with the combinatorics of matroids and their flats…
We explore a combinatorial theory of linear dependency in complex space, "complex matroids", with foundations analogous to those for oriented matroids. We give multiple equivalent axiomatizations of complex matroids, showing that this…
We provide a short proof of a conic version of the colorful Carath\'eodory theorem for oriented matroids. Holmsen's extension of the colorful Carath\'eodory theorem to oriented matroids (Advances in Mathematics, 2016) already encompasses…
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…
The separation theorem of Kirchberger can be proven using a combination of Farkas' Lemma and Caratheodory's Theorem. Since those theorems are at the heart of oriented matroids, we are interested in a generalization of Kirchberger's Theorem…
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…
A theorem of Mandel allows to determine the covector set of an oriented matroid from its set of topes by using the composition condition. We provide a generalization of that result, stating that the covector set of a conditional oriented…
Determinant maximization provides an elegant generalization of problems in many areas, including convex geometry, statistics, machine learning, fair allocation of goods, and network design. In an instance of the determinant maximization…
Many combinatorial properties of a point set in the plane are determined by the set of possible partitions of the point set by a line. Their essential combinatorial properties are well captured by the axioms of oriented matroids. In fact,…
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…