Related papers: Locally Heavy Hyperplanes in Multiarrangements

Only few categories of free arrangements are known in which Terao's conjecture holds. One of such categories consists of $3$-arrangements with unbalanced Ziegler restrictions. In this paper, we generalize this result to arbitrary…

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 will consider some characterizations of freeness of a hyperplane arrangement, in terms of the following properties: locally freeness, factorization of characteristic polynomial and freeness of restricted multiarrangement. In the case of…

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…

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…

In this article we show that any free hyperplane arrangement with exponents 1's and 2's is a supersolvable arrangement. We conjecture that any free arrangement with exponents 1's, 2's and exactly one 3, is also supersolvable, and we show…

The freeness of hyperplane arrangements in a three dimensional vector space over finite field is discussed. We prove that if the number of hyperplanes is greater than some bound, then the freeness is determined by the characteristic…

In this paper, we show how to compute using Fitting ideals the nonfree locus of the moduli space of arrangements of a rank $3$ simple matroid, i.e., the subset of all points of the moduli space which parametrize nonfree arrangements. Our…

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…

Inspired by Terao's freeness conjecture, we examine Ziegler pairs, which are pairs of hyperplane arrangements that share the same underlying matroid but have different modules of logarithmic derivations. In this paper, we present a general…

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…

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…

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…

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 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 $A$ be a free hyperplane arrangement. In 1989, Ziegler showed that the restriction $A''$ of $A$ to any hyperplane endowed with the natural multiplicity is then a free multiarrangement. We initiate a study of the stronger freeness…

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 study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…

We introduce the use of liaison addition to the study of hyperplane arrangements. For an arrangement, $\mathcal A$, of hyperplanes in $\mathbb P^n$, $\mathcal A$ is free if $R/J$ is Cohen-Macaulay, where $J$ is the Jacobian ideal of…

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…