Related papers: Efficiency and complexity of hyperplane arrangemen…
For any particular class of graphs, algorithms for computational problems restricted to the class often rely on structural properties that depend on the specific problem at hand. This begs the question if a large set of such results can be…
We describe an algorithm computing the monodromy and the pole order filtration on the Milnor fiber cohomology of any reduced projective plane curve $C$. The relation to the zero set of Bernstein-Sato polynomial of the defining homogeneous…
In this note we consider the Milnor fiber $F$ associated to a reduced projective plane curve $C$. A computational approach for the determination of the characteristic polynomial of the monodromy action on the first cohomology group of $F$,…
The characteristic varieties of a space are the jump loci for homology of rank 1 local systems. The way in which the geometry of these varieties may vary with the characteristic of the ground field is reflected in the homology of finite…
In this paper, we compute the (total) Milnor-Witt motivic cohomology of the complement of a hyperplane arrangement in an affine space as an algebra with given generators and relations. We also obtain some corollaries by realization to…
Questions that seek to determine whether a hyperplane arrangement property, be it geometric, arithmetic or topological, is of a combinatorial nature (that is determined by the intersection lattice) are abundant in the literature. To tackle…
Given a set of $m$ points and a set of $n$ lines in the plane, we consider the problem of computing the faces of the arrangement of the lines that contain at least one point. In this paper, we present an $O(m^{2/3}n^{2/3}+(n+m)\log n)$ time…
We show that the cohomology of a rank 1 local system on the complement of a projective hyperplane arrangement can be calculated by the Aomoto complex in certain cases even if the condition on the sum of the residues of connection due to…
We implement new techniques involving Artin fans to study the realizability of tropical stable maps in superabundant combinatorial types. Our approach is to understand the skeleton of a fundamental object in logarithmic Gromov--Witten…
The complement of a hyperplane arrangement in the complex projective space is known to be formal. We prove the global Milnor fiber associated to the homogeneous polynomial defining the arrangement may not even be 1-formal, by giving an…
A rank one local system $\LL$ on a smooth complex algebraic variety $M$ is admissible roughly speaking if the dimension of the cohomology groups $H^m(M,\LL)$ can be computed directly from the cohomology algebra $H^*(M,\C)$. We say that a…
We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…
We calculate the higher topological complexity TC$_s$ for the complements of reflection arrangements, in other words for the pure Artin type groups of all finite complex reflection groups. In order to do that we introduce a simple…
We study enumerative questions on the moduli space $\mathcal{M}(L)$ of hyperplane arrangements with a given intersection lattice $L$. Mn\"ev's universality theorem suggests that these moduli spaces can be arbitrarily complicated; indeed it…
We consider arrangements of n connected codimensional one submanifolds in closed d-dimensional manifold M. Let f be the number of connected components of the complement in M to the union of submanifolds. We prove the sharp lower bound for f…
To a plane algebraic curve of degree n, Moishezon associated a braid monodromy homomorphism from a finitely generated free group to Artin's braid group B_n. Using Hansen's polynomial covering space theory, we give a new interpretation of…
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)…
We estimate the number of incidences in a configuration of $m$ lines and $n$ points in dimension 3. The main term is $mn^{1/3}$ if we work over the real or complex numbers but $mn^{2/5}$ over finite fields. Both of these are optimal, aside…
We prove that the topological complexity of (a motion planning algorithm on) the complement of generic complex essential hyperplane arrangement of $n$ hyperplanes in an $r$-dimensional linear space is min$\{n+1,2r\}$.
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…