Related papers: The Varchenko Matrix for Dehyperplane Arrangement
In the theory of hyperplane arrangements, M. Wakefield and S. Yuzvinsky utilized a square matrix in their research on the exponents of $2$-dimensional multiarrangements. Using such a matrix, they showed that the exponents of $2$-dimensional…
A topological hyperplane is a subspace of R^n (or a homeomorph of it) that is topologically equivalent to an ordinary straight hyperplane. An arrangement of topological hyperplanes in R^n is a finite set H such that k topological…
We consider the D-module defined as the push-forward of a rank one linear system on the complement of a central plane hyperplane arrangement, and calculate its decomposition series, using algebraic calculations in the Weyl algebra.
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…
In this article we prove in the main theorem that, there is a bijection between the isomorphism classes of a certain type of real hyperplane arrangements on the one hand, and the antipodal pairs of convex cones of an associated…
We investigate the Helmholtz equation with suitable boundary conditions and uncertainties in the wavenumber. Thus the wavenumber is modeled as a random variable or a random field. We discretize the Helmholtz equation using finite…
An arrangement of hyperplanes is a finite collection of hyperplanes in a real Euclidean space. To such a collection one associates the characteristic polynomial that encodes the combinatorics of intersections of the hyperplanes. Finding the…
Let $ V $ a vector space of dimension $n$. A $V$ family $ \{H_1, \ldots, H_p \} $ of vectorial hyperplanes being distinct two by two defines an arrangement $ {\cal A}_p = {\cal A} ( H_1, \ldots ,H_p ) $ of $ V $. For $ i \in \{ 1, \ldots, p…
In this work we compute the Stokes matrices of the ordinary differential equation satisfied by the hypergeometric integrals associated to an arrangement of hyperplanes in generic position. This generalizes the computation done by Ramis and…
We will start from the beginning and define a matroid and its Orlik-Solomon algebra and holonomy Lie algebra, but first we give some background from topology and cohomology. A (central) hyperplane arrangement is a finite number of subspaces…
We compute the multiplier ideals of hyperplane arrangements via the interpretation of these ideals in terms of spaces of arcs, due to Ein, Lazarsfeld and the author.
Hyperplane arrangements form the latest addition to the zoo of combinatorial objects dealt with by polymake. We report on their implementation and on a algorithm to compute the associated cell decomposition. The implemented algorithm…
Algorithms involving Gaussian processes or determinantal point processes typically require computing the determinant of a kernel matrix. Frequently, the latter is computed from the Cholesky decomposition, an algorithm of cubic complexity in…
This paper provides an overview of selected results and open problems in the theory of hyperplane arrangements, with an emphasis on computations and examples. We give an introduction to many of the essential tools used in the area, such as…
An integral coefficient matrix determines an integral arrangement of hyperplanes in R^m. After modulo q reduction, the same matrix determines an arrangement A_q of "hyperplanes" in Z^m. In the special case of central arrangements, Kamiya,…
A generalized definition of the determinant of matrices is given, which is compatible with the usual determinant for square matrices and keeps many important properties, such as being an alternating multilinear function, keeping…
In these notes we study hyperplane arrangements having at least one logarithmic derivation of degree two that is not a combination of degree one logarithmic derivations. It is well-known that if a hyperplane arrangement has a linear…
The characteristic polynomial plays an important role in study of hyperplane arrangements. There are several refinements of the characteristic polynomial. One of them is the coboundary polynomial defined by Crapo. Another refinement is the…
Let $\D$ be a set of $n$ pairwise disjoint unit balls in $\R^d$ and $P$ the set of their center points. A hyperplane $\Hy$ is an \emph{$m$-separator} for $\D$ if each closed halfspace bounded by $\Hy$ contains at least $m$ points from $P$.…
A problem that is frequently encountered in a variety of mathematical contexts, is to find the common invariant subspaces of a single, or set of matrices. A new method is proposed that gives a definitive answer to this problem. The key idea…