Related papers: Multiple addition, deletion and restriction theore…
The addition-deletion theorems for hyperplane arrangements, which were originally shown in [H. Terao, Arrangements of hyperplanes and their freeness I, II. J. Fac. Sci. Univ. Tokyo Sect. IA Math. 27 (1980), 293--320], provide useful ways 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…
We introduce the class of MAT-free hyperplane arrangements which is based on the Multiple Addition Theorem by Abe, Barakat, Cuntz, Hoge, and Terao. We also investigate the closely related class of MAT2-free arrangements based on a recent…
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…
This is a survey and research note on the modified Orlik conjecture derived from the division theorem introduced in [2]. The division theorem is a generalization of classical addition-deletion theorems for free arrangements. The division…
We consider the behaviour of logarithmic differential forms on arrangements and multiarrangements of hyperplanes under the operations of deletion and restriction, extending early work of G\"unter Ziegler. The restriction of logarithmic…
In this note we study the logarithmic derivation module of a non-free arrangement. We prove a generalized addition theorem for all arrangements. This addition theorem allows us to find various relationships between non-free arrangements,…
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…
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…
Ideal subarrangements of a Weyl arrangement are proved to be free by the multiple addition theorem (MAT) due to Abe-Barakat-Cuntz-Hoge-Terao (2016). They form a significant class among Weyl subarrangements that are known to be free so far.…
We study the notion of a nice partition or factorization of a hyperplane arrangement due to Terao from the early 1990s. The principal aim of this note is an analogue of Terao's celebrated addition-deletion theorem for free arrangements for…
Deletion-restriction is a fundamental tool in the theory of hyperplane arrangements. Various important results in this field have been proved using deletion-restriction. In this paper we use deletion-restriction to identify a class of toric…
This paper studies the algebraic structure of a new class of hyperplane arrangement $A$ obtained by deleting two hyperplanes from a free arrangement. We provide information on the minimal free resolutions of the logarithmic derivation…
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…
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…
We prove the addition-deletion theorems for the Solomon-Terao polynomials, which have two important specializations. Namely, one is to the characteristic polynomials of hyperplane arangements, and the other to the Poincar\`{e} polynomials…
We establish a general theory for projective dimensions of the logarithmic derivation modules of hyperplane arrangements. That includes the addition-deletion and restriction theorem, Yoshinaga-type result, and the division theorem for…
Let ${\mathcal C}= \bigcup_{i=1}^n C_i \subseteq \mathbb{P}^2$ be a collection of smooth rational plane curves. We prove that the addition-deletion operation used in the study of hyperplane arrangements has an extension which works for a…
M. Mustata used jet schemes to compute the multiplier ideals of reduced hyperplane arrangements. We give an alternate proof using a log resolution, which is simpler and allows us to consider non-reduced arrangements. By applying the idea of…
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,…