Related papers: Diagonal Form of the Varchenko Matrices

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 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…

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 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…

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…

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…

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…

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$:…

In this paper, we investigate $q$-Varchenko matrices for some hyperplane arrangements with symmetry in two and three dimensions, and prove that they have a Smith normal form over $\mathbb Z[q]$. In particular, we examine the hyperplane…

This paper surveys some combinatorial aspects of Smith normal form, and more generally, diagonal form. The discussion includes general algebraic properties and interpretations of Smith normal form, critical groups of graphs, and Smith…

Discriminantal arrangements are hyperplane arrangements, which are generalized braid ones. They are constructed from given hyperplane arrangements, but their combinatorics are not invariant under combinatorial equivalence. However, it is…

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…

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…

We study Pythagorean hyperplane arrangements, originally defined by Zaslavsky. In this first part of a series on such arrangements, we introduce a new notion of genericity for such arrangements. Using this notion we construct an auxiliary…

A general method to derive the diagonal representation for a generic matrix valued quantum Hamiltonian is proposed. In this approach new mathematical objects like non-commuting operators evolving with the Planck constant promoted as a…

The discriminantal arrangement is the space of configurations of $n$ hyperplanes in generic position in a $k$ dimensional space (see \cite{MS}). Differently from the case $k=1$ in which it corresponds to the well known braid arrangement,…

Let A be an n by d matrix having full rank n. An orthogonal dual A^{\perp} of A is a (d-n) by d matrix of rank (d-n) such that every row of A^{\perp} is orthogonal (under the usual dot product) to every row of A. We define the orthogonal…

We revisit a classical theme of (general or translation invariant) valuations on convex polyhedra. Our setting generalizes the classical one, in a ``dual'' direction to previously considered generalizations: while previous research was…

Let $\mathscr{M}$ be a conditional oriented matroid. We define a graded algebra $\widehat{\mathscr{VG}}_\mathscr{M}$ with vector space dimension given by the number of covectors in $\mathscr{M}$ which admits a distinguished filtration…

Most algorithms constructing bases of finite-dimensional vector spaces return basis vectors which, apart from orthogonality, do not show any special properties. While every basis is sufficient to define the vector space, not all bases are…