Related papers: A linear condition for non-very generic discrimina…
In this paper, we present a combinatorial characterization of the hyperplanes associated with non-singular hermitian varieties ${H}\left(s, q^2\right)$ in the projective space $\mathrm{PG}\left(s,q^2\right)$ where $s\geq3$ and $q>2$. By…
In the present note we study some arrangements of inflectional lines, hyperosculating conics, and a nodal plane cubic that are free. Moreover, we study weak combinatorics of arrangements consisting of lines, conics, and elliptic curves…
We define a combinatorial object that can be associated with any conic-line arrangement with ordinary singularities, which we call the combinatorial Poincar\'e polynomial. We prove a Terao-type factorization statement on the splitting of…
We classify one-element extensions of a hyperplane arrangement by the induced adjoint arrangement. Based on the classification, several kinds of combinatorial invariants including Whitney polynomials, characteristic polynomials, Whitney…
A characteristic-dependent linear rank inequality is a linear inequality that holds by ranks of subspaces of a vector space over a finite field of determined characteristic, and does not in general hold over other characteristics. In this…
Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…
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 note we present examples of $K(\pi,1)$-arrangements which admit a restriction which fails to be $K(\pi,1)$. This shows that asphericity is not hereditary among hyperplane arrangements.
We consider the rigidity and global rigidity of bar-joint frameworks in Euclidean $d$-space under additional dilation constraints in specified coordinate directions. In this setting we obtain a complete characterisation of generic rigidity.…
A hyperplane arrangement in $\mathbb{R}^n$ is a finite collection of affine hyperplanes. The regions are the connected components of the complement of these hyperplanes. By a theorem of Zaslavsky, the number of regions of a hyperplane…
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…
A hyperplane arrangement is said to satisfy the ``Riemann hypothesis'' if all roots of its characteristic polynomial have the same real part. This property was conjectured by Postnikov and Stanley for certain families of arrangements which…
We construct two combinatorially equivalent line arrangements in the complex projective plane such that the fundamental groups of their complements are not isomorphic. The proof uses a new invariant of the fundamental group of the…
In the theory of hyperplane arrangements, the most important and difficult problem is the combinatorial dependency of several properties. In this atricle, we prove that Terao's celebrated addition-deletion theorem for free arrangements is…
We give a necessary and sufficient condition in order for a hyperplane arrangement to be of Torelli type, namely that it is recovered as the set of unstable hyperplanes of its Dolgachev sheaf of logarithmic differentials. Decompositions and…
We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…
It is an open question to give a combinatorial interpretation of the Falk invariant of a hyperplane arrangement, i.e. the third rank of successive quotients in the lower central series of the fundamental group of the arrangement. In this…
Building on the theory of causal discovery from observational data, we study interactions between multiple (sets of) random variables in a linear structural equation model with non-Gaussian error terms. We give a correspondence between…
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…
We study the connection between probability distributions satisfying certain conditional independence (CI) constraints, and point and line arrangements in incidence geometry. To a family of CI statements, we associate a polynomial ideal…