Related papers: The Varchenko Matrix for Dehyperplane Arrangement

Only few categories of free arrangements are known in which Terao's conjecture holds. One of such categories consists of $3$-arrangements with unbalanced Ziegler restrictions. In this paper, we generalize this result to arbitrary…

M. Saito recently proved that the jumping numbers of a hyperplane arrangement depend only on the combinatorics of the arrangement. However, a formula in terms of the combinatorial data was still missing. In this note, we give a formula and…

This paper gives an extension of the classical Zariski-van Kampen theorem describing the fundamental groups of the complements of plane singular curves by generators and relations. It provides a procedure for computation of the first…

The set of matrix tuples with invariant subspaces whose dimensions sum up to the dimension of the space, but which do not span the whole space form an algebraic hypersurface. We found the equation of this hypersurface. This generalizes…

We consider a family of generic weighted arrangements of $n$ hyperplanes in $\C^k$ and show that the Gauss-Manin connection for the associated hypergeometric integrals, the contravariant form on the space of singular vectors, and the…

We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.

Determinantal varieties -- the sets of bounded-rank matrices or tensors -- have attracted growing interest in low-rank optimization. The tangent cone to low-rank sets is widely studied and underpins a range of geometric methods. The…

In this paper, the authors investigate non-homogeneous Hamiltonian operators composed of a first-order Dubrovin-Novikov operator and an ultralocal one. The study of such operators turns out to be fundamental for the inverted system of…

This thesis is divided into three parts. The first part deals with cylindric plane partitions. The second with lambda-determinants and the third with commutators in semi-circular systems. For more detailed abstract please see inside.…

Manin and Schechtman introduced a family of arrangements of hyperplanes generalizing classical braid arrangements, which they called the $\textit{discriminantal arrangements}$. Athanasiadis proved a conjecture by Bayer and Brandt providing…

Plane arrangements are a useful tool for surface and volume modelling. However, their main drawback is poor scalability. We introduce two key novelties that enable the construction of plane arrangements for complex objects and entire…

Orthogonal sets of idempotents are used to design sets of unitary matrices, known as constellations, such that the modulus of the determinant of the difference of any two distinct elements is greater than $0$. It is shown that unitary…

The Euler discriminant of a family of very affine varieties is defined as the locus where the Euler characteristic drops. In this work, we study the Euler discriminant of families of complements of hyperplanes. We prove that the Euler…

Matrix polynomials given in an orthogonal basis are considered. Following the ideas of Mackey et al. "Vector spaces of Linearizations for Matrix Polynomials" (2006), the vec- tor spaces, called M1(P), M2(P) and DM(P), of potential…

Let $\mathcal{A}$ be a hyperplane arrangement in a complex projective space. It is an open question if the degree one cohomology jump loci (with complex coefficients) are determined by the combinatorics of $\mathcal{A}$. By the work of Falk…

In the present paper, we consider a Cauchy problem for a linear second order in time abstract differential equation with pure delay. In the absence of delay, this problem, known as the harmonic oscillator, has a two-dimensional eigenspace…

In a previous work arXiv:physics/0611108v2, it was shown that the volume spanned by a molecular system in its conformational space can be effectively bounded by a polyhedral cone, this cone is described by means of a simple combinatorial…

A fundamental problem in computational algebraic geometry is the computation of the resultant. A central question is when and how to compute it as the determinant of a matrix. whose elements are the coefficients of the input polynomials…

A finite element methodology for large classes of variational boundary value problems is defined which involves discretizing two linear operators: (1) the differential operator defining the spatial boundary value problem; and (2) a Riesz…

We present a new, practical algorithm for computing the determinant of a non-singular dense, uniform matrix over Z; the aim is to achieve better practical efficiency, which is always at least as good as currently known methods. The…