Related papers: The Varchenko Determinant of an Oriented Matroid
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$:…
We generalize the Varchenko matrix of a hyperplane arrangement to oriented matroids. We show that the celebrated determinant formula for the Varchenko matrix, first proved by Varchenko, generalizes to oriented matroids. It follows that the…
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 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…
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 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…
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…
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…
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…
In this paper we shed more light on determinants of interval matrices. Computing the exact bounds on a determinant of an interval matrix is an NP-hard problem. Therefore, attention is first paid to approximations. NP-hardness of both…
Kaltofen has proposed a new approach in [Kaltofen 1992] for computing matrix determinants. The algorithm is based on a baby steps/giant steps construction of Krylov subspaces, and computes the determinant as the constant term of a…
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…
The algebra of $R$-valued functions on the set of chambers of a real hyperplane arrangement is called the Varchenko-Gelfand (VG) algebra. This algebra carries a natural filtration by the degree with respect to Heaviside functions, giving…
We compare three filtrations of the tope space of an oriented matroid. The first is the dual Varchenko-Gelfand degree filtration, the second filtration is from Kalinin's spectral sequence, and the last one derives from Quillen's…
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…
The determinants of $\{\pm 1\}$-matrices are calculated by via the oriented hypergraphic Laplacian and summing over an incidence generalization of vertex cycle-covers. These cycle-covers are signed and partitioned into families based on…
For a real affine hyperplane arrangement, we define an integer intersection matrix with a natural $q$-deformation related to the intersections of bounded chambers of the arrangement. By connecting the integer matrix to a bilinear form of…
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…
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".