相关论文: Freeness and near freeness are combinatorial for l…

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 the present note we focus on conic line arrangements in the plane with quasihomogeneous ordinary singularities from the perspective of weak Ziegler pairs. The foundations of this article come from an active area of research devoted to…

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…

By way of Ziegler restrictions we study the relation between nearly free plane arrangements and combinatorics and we give a Yoshinaga-type criterion for plus-one generated plane arrangements.

In the category of free arrangements, inductively and recursively free arrangements are important. In particular, in the former, Terao's open problem asking whether freeness depends only on combinatorics is true. A long standing problem…

This note gives the complete projective classification of rational, cuspidal plane curves of degree at least 6, and having only weighted homogeneous singularities. It also sheds new light on some previous characterizations of free and…

Let $\A$ be a free arrangement of $d$ lines in the complex projective plane, with exponents $d_1\leq d_2$. Let $m$ be the maximal multiplicity of points in $\A$. In this note, we describe first the simple cases $d_1 \leq m$. Then we study…

We provide a classification result on nearly free arrangements of lines in the complex projective plane with nodes and triple points.

We present a combinatorial structure of generators of $D(\mathcal{A}).$ This structure permits us to detect the relationship between the combinatorial determined property and the singularity of vector field. Consequently, by using only…

In this paper we present a smallest possible counterexample to the Numerical Terao's Conjecture in the class of line arrangements in the complex projective plane. Our example consists of a pair of two arrangements with $13$ lines. Moreover,…

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 some aspects of divisionally free arrangements which were recently introduced by Abe. Crucially, Terao's conjecture on the combinatorial nature of freeness holds within this class. We show that while it is compatible with products,…

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 study a generalized version of Terao's famous addition theorem for free arrangements to the category of those with projective dimension one. Namely, we give a criterion to determine the algebraic structure of logarithmic derivation…

Let $\mathcal C :f=0$ be a curve arrangement in the complex projective plane. If $\mathcal C$ contains a curve subarrangement consisting of at least three members in a pencil, then one obtains an explicit syzygy among the partial…

Hyperplane Arrangements of rank $3$ admitting an unbalanced Ziegler restriction are known to fulfill Terao's conjecture. This long-standing conjecture asks whether the freeness of an arrangement is determined by its combinatorics. In this…

We prove that under certain combinatorial conditions, the realization spaces of line arrangements on the complex projective plane are connected. We also give several examples of arrangements with eight, nine and ten lines which have…

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…

In 2002, Terao showed that every reflection multi-arrangement of a real reflection group with constant multiplicity is free by providing a basis of the module of derivations. We first generalize Terao's result to multi-arrangements stemming…

We introduce a combinatorial characterization of simpliciality for arrangements of hyperplanes. We then give a sharp upper bound for the number of hyperplanes of such an arrangement in the projective plane over a finite field, and present…