Generalizing a result of Yoshinaga in dimension 3, we show that a central hyperplane arrangement in 4-space is free exactly if its restriction with multiplicities to a fixed hyperplane of the arrangement is free and its reduced characteristic polynomial equals the characteristic polynomial of this restriction. We show that the same statement holds true in any dimension when imposing certain tameness hypotheses.
In this article we describe two new characterizations of freeness for hyperplane arrangements via the study of the generic initial ideal and of the sectional matrix of the Jacobian ideal of arrangements.
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 dimensional arrangements in terms of flags by introducing unbalanced multiarrangements. For that purpose, we generalize several freeness criterions for simple arrangements, including Yoshinaga's freeness criterion, to unbalanced multiarrangements.
In this paper, we study the class of free multiarrangements of hyperplanes. Specifically, we investigate the relations between freeness over a field of finite characteristic and freeness over the rationals.
In this paper, we study the class of free hyperplane arrangements. Specifically, we investigate the relations between freeness over a field of finite characteristic and freeness over $\mathbb{Q}$.
This is the expanded notes of the lecture by the author in "Arrangements in Pyrenees", June 2012. We are discussing relations of freeness and splitting problems of vector bundles, several techniques proving freeness of hyperplane arrangements, K. Saito's theory of primitive derivations for Coxeter arrangements, their application to combinatorial problems and related conjectures.
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 note, we prove that arrangements that admit a locally heavy flag satisfy Terao's conjecture which is a generalization of the statement above to arbitrary dimension. To this end, we extend results characterizing the freeness of multiarrangements with a heavy hyperplane to those satisfying the weaker notion of a locally heavy hyperplane. As a corollary, we give…
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 logarithmic derivation modules generated by dimension plus one elements, with relations containing one linear form coefficient. We show that strictly plus-one generated arrangements can be obtained if we delete a hyperplane from free arrangements. We show a relative freeness criterion in terms of plus-one generatedness. In particular, for plane arrangements, we show…
We give the upper bound of differences of exponents for balanced 2-multiarrangements in terms of the cardinality of hyperplanes. Also, we give a shift isomorphism of 2-multiarrangements like Coxeter arrangements when the difference of exponents is maximum. As an application, a sufficient numerical and combinatorial condition for 3-arrangements to be free is given.
We establish the relationship between the cohomology of a certain sheaf on the intersection lattice of a hyperplane arrangement introduced by Yuzvinsky and the cohomology of the coherent sheaf on punctured affine space, respectively projective space associated to the module of logarithmic vector fields along the arrangement. Our main result gives a Künneth formula connecting the cohomology theories, answering a question by Yoshinaga. This, in turn, provides a characterization of the projective dimension of the module of logarithmic vector fields and yields a new proof of Yuzvinsky's freeness c…
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 approach relies on the so-called Ziegler restriction and Yoshinaga's freeness criterion for multiarrangements. We use these computations to verify Terao's freeness conjecture for rank $3$ central arrangements with up to $14$ hyperplanes in any characteristic.
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 and necessary condition for the deletion theorem in terms of characteristic polynomials. This gives a lot of corollaries including the existence of free filtrations. The proof is based on the result about the form of minimal generators of a logarithmic derivation module of a multiarrangement which satisfies the $b_2$-equality.
We study the Hadamard product of the linear forms defining a hyperplane arrangement with those of its dual, which we view as generating an ideal in a certain polynomial ring. We use this ideal, which we call the ideal of pairs, to study logarithmic derivations and critical set varieties of arrangements in a way which is symmetric with respect to matroid duality. Our main result exhibits the variety of the ideal of pairs as a subspace arrangement whose components correspond to cyclic flats of the arrangement. As a corollary, we are able to give geometric explanations of some freeness and projec…
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 combinatorial, i.e., whether you can apply it depends only on the intersection lattice of arrangements. The proof is based on a classical technique. Since some parts are already completed recently, we prove the rest part, i.e., the combinatoriality of the addition theorem. As a corollary, we can define a new class of free arrangements called the additionally …
We propose an approach to study logarithmic sheaves T(-log A) associated with a hyperplane arrangements A on the projective space, based on projective duality, direct image functors and vector bundles methods. We focus on freeness of line arrangements having a point with high multiplicity.
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 $\mathcal A$. Terao's conjecture says that freeness of $\mathcal A$ is determined by the combinatorics of the intersection lattice of $\mathcal A$. We study the Cohen-Macaulayness of three other ideals, all unmixed, that are closely related to $\mathcal A$. Let $\overline J = \mathfrak q_1 \cap \dots \cap \mathfrak q_s$ be the intersection of height two primary com…
Several papers have been written studying unexpected hypersurfaces. We say a finite set of points Z admits unexpected hypersurfaces if a general union of fat linear subspaces imposes less that the expected number of conditions on the ideal of Z. In this paper, we introduce the concept of a very unexpected hypersurface. This is a stronger condition which takes into account an explanation for some hypersurfaces previously considered unexpected. We then develop a duality theory to relate the study of very unexpected hypersurfaces to the derivations of dual hyperplane arrangements. This allows us …
The Euler multiplicity and addition-deletion theorems for multiarrangements
超平面构形的增删定理最初在[H. Terao，超平面的排列及其自由度I，II。J. Fac. Sci. Univ. Tokyo Sect. IA Math.27（1980），293- 320]，提供了构造自由排列的例子的有用方法。在这篇文章中，我们证明了添加删除定理的多重安排。推广的一个关键是定义一个新的多重性，称为欧拉多重性，一个受限制的多重排列。我们在许多情况下计算欧拉多重数。然后，我们应用添加删除定理，以各种安排，包括超可解安排和Coxeter安排类型$A_{3}$，以构建自由和非自由的多重安排。
