Related papers: Free line arrangements with low maximal multiplici…
In this note, we show that real line arrangements of type at most one, admitting only intersection points of multiplicity at most five, satisfy certain boundedness properties. In particular, we prove that a free real arrangement of $d$…
In the present note we provide a complete classification of nearly free (and not free simultaneously) simplicial arrangements of $d\leq 27$ lines.
We show that there are only finitely many combinatorial types of free real line arrangements with only double, triple and quadruple intersection points, and we enlist all admissible weak-combinatorics of them. Then we classify all real…
We prove Terao conjecture saying that the freeness is determined by the combinatorics for arrangements of 13 lines in the complex projective plane and that the property of being nearly free is combinatorial for line arrangements of up to 12…
We introduce a new class of arrangements of hyperplanes, called (strictly) plus-one generated arrangements, from algebraic point of view. Plus-one generatedness is close to freeness, i.e., plus-one generated arrangements have their…
In the present note we provide a partial classification of nearly free conic-line arrangements in the complex plane having nodes, tacnodes, and ordinary triple points. In this setting, our theoretical bound tells us that the degree of such…
We study the free path problem, i.e., if we are given two free arrangements of hyperplanes, then we can connect them by free arrangements or not. We prove that if an arrangement $\mathcal{A}$ and $\mathcal{A} \setminus \{H,L\}$ are free,…
Let $C$ be a reduced complex projective plane curve, and let $d_1$ and $d_2$ be the first two smallest exponents of $C$. For a free curve $C$ of degree $d$, there is a simple formula relating $d,d_1, d_2$ and the total Tjurina number of…
In the category of free arrangements, inductively and recursively free arrangements are important. In particular, in the former, the conjecture by Terao asserting that freeness depends only on combinatorics holds true. A long standing…
In this paper we study plus-one generated arrangements of conics and lines in the complex projective plane with simple singularities. We provide several degree-wise classification results that allow us to construct explicit examples of such…
We give a geometric characterisation of plus-one generated projective line arrangements that are next-to-free. We present new succinct proofs, via associated line bundles, for some properties of plus-one generated projective line…
We study the change of the minimal degree of a logarithmic derivation of a hyperplane arrangement under the addition or the deletion of a hyperplane, and give a number of applications. First, we prove the existence of Tjurina maximal line…
We study the combinatorics of pseudoline arrangements in the real projective plane. Our focus lies on two classes of arrangements: simplicial arrangements and arrangements whose characteristic polynomials have only real roots. We derive…
We give some new advances in the research of the maximum number of triangles that we may obtain in a simple arrangements of n lines or pseudo-lines.
A free multiarrangement of rank $k$ is defined to be extendable if it is obtained from a simple rank $(k+1)$ free arrangement by the natural restriction to a hyperplane (in the sense of Ziegler). Not all free multiarrangements are…
The purpose of this note is to study configurations of lines in projective planes over arbitrary fields having the maximal number of intersection points where three lines meet. We give precise conditions on ground fields F over which such…
In the present note we construct new families of free plane curves starting from a curve $C$ and adding high order inflectional tangent lines of $C$, lines joining the singularities of the curve $C$, or lines in the tangent cone of some…
We show that the deletion theorem of a free arrangement is combinatorial, i.e., whether we can delete a hyperplane from a free arrangement keeping freeness depends only on the intersection lattice. In fact, we give an explicit sufficient…
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 show that the number of lines in an $m$--homogeneous supersolvable line arrangement is upper bounded by $3m-3$ and we classify the $m$--homogeneous supersolvable line arrangements with two modular points up-to lattice-isotopy. A lower…