Related papers: Divisionally free Restrictions of Reflection Arran…
Let $\mathcal{A} = \mathcal{A}(W)$ be the reflection arrangement of the finite complex reflection group $W$. By Terao's famous theorem, the arrangement $\mathcal{A}$ is free. In this paper we classify all reflection arrangements which…
Suppose that W is a finite, unitary, reflection group acting on the complex vector space V. Let A = A(W) be the associated hyperplane arrangement of W. Terao has shown that each such reflection arrangement A is free. Let L(A) be the…
Let W be a finite complex reflection group acting on the complex vector space V and let A(W) = (A(W), V) be the associated reflection arrangement. In an earlier paper by the last two authros, we classified all inductively free reflection…
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…
Suppose that W is a finite, unitary reflection group acting on the complex vector space V. Let A = A(W) be the associated hyperplane arrangement of W. Terao has shown that each such reflection arrangement A is free. There is the stronger…
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 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…
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…
Let A = (A,V) be a complex hyperplane arrangement and let L(A) denote its intersection lattice. The arrangement A is called supersolvable, provided its lattice L(A) is supersolvable, a notion due to Stanley. Jambu and Terao showed that…
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…
In a recent paper, Hoge and the second author classified all nice and all inductively factored reflection arrangements. In this note we extend this classification by determining all nice and all inductively factored restrictions of…
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 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…
We consider the triple $(\mathcal{A},\mathcal{A}',\mathcal{A}^H)$ of hyperplane arrangements and the division of their characteristic polynomials. We show that the freeness of $\mathcal{A}^H$ and the division of $\chi(\mathcal{A};t)$ by…
We study differential forms invariant under a finite reflection group over a field of arbitrary characteristic. In particular, we prove an analogue of Saito's freeness criterion for invariant differential 1-forms. We also discuss how…
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…
We exhibit a particular free subarrangement of a certain restriction of the Weyl arrangement of type $E_7$ and use it to give an affirmative answer to a recent conjecture by T.~Abe on the nature of additionally free and stair-free…
We construct counterexamples to the conjecture that every free arrangement is recursively free in characteristic zero. The intersection lattice of our smallest example has a realization over a finite field which is recursively free, thus…
We study some aspects of reflexive modules. For example, we search conditions for which reflexive modules are free or being very close to free modules.
The reflection arrangement of a Coxeter group is a well known instance of a free hyperplane arrangement. In 2002, Terao showed that equipped with a constant multiplicity each such reflection arrangement gives rise to a free…