Related papers: A linear condition for non-very generic discrimina…
We consider a twisted version of the Hurewicz map on the complement of a hyperplane arrangement. The purpose of this paper is to prove surjectivity of the twisted Hurewicz map under some genericity conditions. As a corollary, we also prove…
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…
We construct Hamiltonians for systems of nonrelativistic particles linearly coupled to massive scalar bosons using abstract boundary conditions. The construction yields an explicit characterisation of the domain of self-adjointness in terms…
Give deterministic necessary and sufficient conditions to guarantee that if a subspace fits certain partially observed data from a union of subspaces, it is because such data really lies in a subspace. Furthermore, Give deterministic…
We generalise the existence of combinatorial designs to the setting of subset sums in lattices with coordinates indexed by labelled faces of simplicial complexes. This general framework includes the problem of decomposing hypergraphs with…
We study diagonal arrangement complements $D(K)$ in $\mathbb{C}^m$. We consider the class of simplicial complexes $K$ in which any two missing faces have a common vertex, and prove that the coordinate arrangement complement $U(K)$ is the…
The minimal model program suggests a compactification of the moduli space of hyperplane arrangements which is a moduli space of stable pairs. Here, a stable pair consists of a scheme X which is a degeneration of projective space and a…
Suppose that W is a finite, unitary reflection group acting on the complex vector space V. Let A = A(W) be the associated hyperplane arrangement of W. Terao has shown that each such reflection arrangement A is free. There is the stronger…
We construct counterexamples to Yoshinaga's conjecture that every free arrangement is either inductively free or rigid in characteristic zero. The smallest example has $13$ hyperplanes, its intersection lattice has a one dimensional moduli…
A subspace arrangement in a vector space is a finite collection of vector subspaces. Similarly, a configuration of linear spaces in a projective space is a finite collection of linear subspaces. In this paper we study the degree 2 part of…
We will consider some characterizations of freeness of a hyperplane arrangement, in terms of the following properties: locally freeness, factorization of characteristic polynomial and freeness of restricted multiarrangement. In the case of…
We fix three natural numbers $k, n, N$, such that $n+k+1=N$, and introduce the notion of two dual arrangements of hyperplanes. One of the arrangements is an arrangement of $N$ hyperplanes in a $k$-dimensional affine space, the other is an…
A linearly constrained framework in $\mathbb{R}^d$ is a bar-joint framework where, in addition, vertices with loops are constrained to lie in given affine subspaces. In the generic case, when each vertex is incident to sufficiently many…
We prove a remarkable combinatorial symmetry in the number of spanning configurations in site percolation: for a large class of lattices, the number of spanning configurations with an odd or even number of occupied sites differs by $\pm 1$.…
We show that the conditions imposed on a second order linear differential equation with rational coefficients on the complex line by requiring it to have regular singularities with fixed exponents at the points of a finite set $P$ and…
The Jacobian ideal of a hyperplane arrangement is an ideal in the polynomial ring whose generators are the partial derivatives of the arrangements defining polynomial. In this article, we prove that an arrangement can be reconstructed from…
An $(n_k)$-configuration is a set of $n$ points and $n$ lines in the projective plane such that their point-line incidence graph is $k$-regular. The configuration is geometric, topological, or combinatorial depending on whether lines are…
We investigate connections between SAT (the propositional satisfiability problem) and combinatorics, around the minimum degree (number of occurrences) of variables in various forms of redundancy-free boolean conjunctive normal forms…
We study supersolvable line arrangements in ${\mathbb P}^2$ over the reals and over the complex numbers, as the first step toward a combinatorial classification. Our main results show that a nontrivial (i.e., not a pencil or near pencil)…
Given an $n$-dimensional vector space $V$ over a field $\mathbb K$, let $2\leq k < n$. There is a natural correspondence between the alternating $k$-linear forms $\varphi$ of $V$ and the linear functionals $f$ of $\bigwedge^kV$. Let…