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 3-arrangement, freeness is characterized by factorization of characteristic polynomial and coincidence of its roots with exponents of restricted multiarrangement. In the case of higher dimension, it is characterized by a kind of locally freeness and freeness of restricted multiarrangement. As an application, we prove the freeness of certain arrangements which is conjectured by Edelman and Reiner.
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.
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.
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.
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.
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.
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 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 whether all free arrangements are recursively free or not was settled by the second author and Hoge very recently, by giving a free but non-recursively free plane arrangement consisting of 27 planes. In this paper, we construct free but non-recursively free plane arrangements consisting of 13 and 15 planes, and show that the example with 13 planes is the smalle…
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 lines in the complex projective plane.
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}$.
Every subarrangement of Weyl arrangements of type $ B_{\ell} $ is represented by a signed graph. Edelman and Reiner characterized freeness of subarrangements between type $ A_{\ell-1} $ and type $ B_{\ell} $ in terms of graphs. Recently, Suyama and the authors characterized freeness for subarrangements containing Boolean arrangements satisfying a certain condition. This article is a sequel to the previous work. Namely, we give a complete characterization for freeness of arrangements between Boolean arrangements and Weyl arrangements of type $ B_{\ell} $ in terms of graphs.
We will prove the freeness of multi-Coxeter arrangements by constructing a basis of the module of vector fields which contact to each reflecting hyperplanes with some multiplicities using K. Saito's theory of primitive derivation.
We study the combinatorics of tropical hyperplane arrangements, and their relationship to (classical) hyperplane face monoids. We show that the refinement operation on the faces of a tropical hyperplane arrangement, introduced by Ardila and Develin in their definition of a tropical oriented matroid, induces an action of the hyperplane face monoid of the classical braid arrangement on the arrangement, and hence on a number of interesting related structures. Along the way, we introduce a new characterization of the types (in the sense of Develin and Sturmfels) of points with respect to a tropica…
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.
We introduce the package \textbf{arrangements} for the software CoCoA. This package provides a data structure and the necessary methods for working with hyperplane arrangements. In particular, the package implements methods to enumerate many commonly studied classes of arrangements, perform operations on them, and calculate various invariants associated to them.
An m-free hyperplane arrangement is a generalization of a free arrangement. Holm asked the following two questions: (1)Does m-free imply (m+1)-free for any arrangement? (2)Are all arrangements m-free for m large enough? In this paper, we characterize m-freeness for product arrangements, while we prove that all localizations of an m-free arrangement are m-free. From these results, we give answers to Holm's questions.
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 $σ$-Gröbner bases. Moreover, we prove that the Terao's conjecture over finite fields implies the conjecture over the rationals.
We prove the existence of Gysin morphisms for hyperplane sections that may not satisfy the usual hypotheses of the Lefschetz hyperplane theorem. As an application, we show the triviality of the Alexander polynomial of a particular class of non-symmetric line arrangements, thus providing positive evidence for a conjecture of Papadima and Suciu.
The fundamental group of the complement of a hyperplane arrangement in a complex vector space is an important topological invariant. The third rank of successive quotients in the lower central series of the fundamental group was called Falk invariant of the arrangement since Falk gave the first formula and asked to give a combinatorial interpretation. In this article, we give a combinatorial formula for the Falk invariant of hyperplane arrangements attached to certain gain graphs.
Let $ G $ be a simple graph of $ \ell $ vertices $ \{1, \dots, \ell \} $ with edge set $ E_{G} $. The graphical arrangement $ \mathcal{A}_{G} $ consists of hyperplanes $ \{x_{i}-x_{j}=0\} $, where $ \{i, j \} \in E_{G} $. It is well known that three properties, chordality of $ G $, supersolvability of $ \mathcal{A}_{G} $, and freeness of $ \mathcal{A}_{G} $ are equivalent. Recently, Richard P. Stanley introduced $ ψ$-graphical arrangement $ \mathcal{A}_{G, ψ} $ as a generalization of graphical arrangements. Lili Mu and Stanley characterized the supersolvability of the $ ψ$-graphical arrangemen…
Each irreducible component of the first resonance variety of a hyperplane arrangement naturally determines a codimension one foliation on the ambient space. The superposition of these foliations define what we call the resonance web of the arrangement. In this paper we initiate the study of these objects with emphasis on their spaces of abelian relations.
Faculty of Mathematics and Computer Science, University of Bucharest（布加勒斯特大学数学与计算机科学学院）；Simion Stoilow Institute of Mathematics（西蒙·斯托伊洛瓦数学研究所）；Institut für Mathematik, Humboldt-Universität zu Berlin（柏林洪堡大学数学研究所）；Department of Mathematics, University of Notre Dame（圣母大学数学系）；Department of Mathematics, Northeastern University（东北大学数学系）
We survey interactions between the topology and the combinatorics of complex hyperplane arrangements. Without claiming to be exhaustive, we examine in this setting combinatorial aspects of fundamental groups, associated graded Lie algebras, higher homotopy groups, cohomology rings, twisted homology with rank 1 complex coefficients, and Milnor fibers.
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 …
If F is a master function corresponding to a hyperplane arrangement A and a collection of weights y, we investigate the relationship between the critical set of F, the variety defined by the vanishing of the one-form w = d log F, and the resonance of y. For arrangements satisfying certain conditions, we show that if y is resonant in dimension p, then the critical set of F has codimension at most p. These include all free arrangements and all rank 3 arrangements.
We prove a characterization of freeness, conjectured by Athanasiadis, for the family of hyperplane arrangements which lie between the Coxeter and the Catalan arrangement of type $A_\ell$. One direction was already proved in [2]. Here we prove the other direction
The minimal model program suggests a compactification of the moduli space of hyperplane arrangements which is a moduli space of stable pairs. Here, a stable pair consists of a scheme X which is a degeneration of projective space and a divisor D=D_1+..+D_n on X which is a limit of hyperplane arrangements. For example, in the 1-dimensional case, the stable pairs are stable curves of genus 0 with n marked points. Kapranov has defined an alternative compactification using his Chow quotient construction, which may be described fairly explicitly. We prove that these two compactifications coincide. W…
A Weyl arrangement is the hyperplane arrangement defined by a root system. Arnold and Saito proved that every Weyl arrangement is free. The Weyl subarrangements of type $A_{\ell}$ are represented by simple graphs. Stanley gave a characterization of freeness for this type of arrangements in terms of thier graph. In addition, The Weyl subarrangements of type $B_{\ell}$ can be represented by signed graphs. A characterization of freeness for them is not known. However, characterizations of freeness for a few restricted classes are known. For instance, Edelman and Reiner characterized the freeness …
Let $G$ be a simple graph on the vertex set $\{v_1,\dots,v_n\}$ with edge set $E$. Let $K$ be a field. The graphical arrangement $\mathcal{A}_G$ in $K^n$ is the arrangement $x_i-x_j=0, v_iv_j \in E$. An arrangement $\mathcal{A}$ is supersolvable if the intersection lattice $L(c(\mathcal{A}))$ of the cone $c(\mathcal{A})$ contains a maximal chain of modular elements. The second author has shown that a graphical arrangement $\mathcal{A}_G$ is supersolvable if and only if $G$ is a chordal graph. He later considered a generalization of graphical arrangements which are called $ψ$-graphical arrangem…
In this article we prove in the main theorem that, there is a bijection between the isomorphism classes of a certain type of real hyperplane arrangements on the one hand, and the antipodal pairs of convex cones of an associated discriminantal arrangement on the other hand. The type of hyperplane arrangements considered and the isomorphism classes have been defined precisely. As a consequence we enumerate such isomorphism classes by computing the characteristic polynomial of the discriminantal arrangement. With a certain restriction, the enumerated value is shown to be independent of the discri…
We prove the torsion freeness of the decomposable Orlik--Solomon algebra of a simple matroid on ground set $[n]$. In the class of hypersolvable \& non-supersolvable complex hyperplane arrangements, the torsion freeness, in a certain degree, of this combinatorially defined object, associated to the intersection lattice of the arrangement, impacts on the first non-vanishing higher homotopy group of the complement of the arrangement.
Let A be a generic hyperplane arrangement composed of r hyperplanes in an n-dimensional vector space, and S the polynomial ring in n variables. We consider the S-submodule D(m)(A) of the nth Weyl algebra of homogeneous differential operators of order m preserving the defining ideal of A. We prove that if n \geq 3, r > n,m > r - n + 1, then D(m)(A) is free (Holm's conjecture). Combining this with some results by Holm, we see that D(m)(A) is free unless n \geq 3, r > n,m < r - n + 1. In the remaining case, we construct a minimal free resolution of D(m)(A) by generalizing Yuzvinsky's construction…
The Ish arrangement was introduced by Armstrong to give a new interpretation of the $q,t$-Catalan numbers of Garsia and Haiman. Armstrong and Rhoades showed that there are some striking similarities between the Shi arrangement and the Ish arrangement and posed some problems. One of them is whether the Ish arrangement is a free arrangement or not. In this paper, we verify that the Ish arrangement is supersolvable and hence free. Moreover, we give a necessary and sufficient condition for the deleted Ish arrangement to be 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 property of inductive freeness for these canonical free multiarrangements and investigate them for the underlying class of reflection arrangements. More precisely, let $A = A(W)$ be the reflection arrangement of a complex reflection group $W$. By work of Terao, each such reflection arrangement is free. Thus so is Ziegler's canonical multiplicity on the restriction…
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 large class of arrangements of smooth rational curves, giving an inductive tool for understanding the freeness of the module $Ω^1({\mathcal C})$ of logarithmic differential forms with pole along ${\mathcal C}$. We also show that the analog of Terao's conjecture (freeness of $Ω^1({\mathcal C})$ is combinatorially determined if ${\mathcal C}$ is a union of lines…
This is a slightly revised version (with references added in) of a survey article which appeared in the Spring 2005 edition of the MSRI newsletter, the Emissary. The article describes some of the themes from the Fall 2004 MSRI program on Hyperplane Arrangements and Applications.
Let $W$ be a finite Weyl group and $\A$ be the corresponding Weyl arrangement. A deformation of $\A$ is an affine arrangement which is obtained by adding to each hyperplane $H\in\A$ several parallel translations of $H$ by the positive root (and its integer multiples) perpendicular to $H$. We say that a deformation is $W$-equivariant if the number of parallel hyperplanes of each hyperplane $H\in \A$ depends only on the $W$-orbit of $H$. We prove that the conings of the $W$-equivariant deformations are free arrangements under a Shi-Catalan condition and give a formula for the number of chambers.…
The purpose of this paper is applying minimality of hyperplane arrangements to local system cohomology groups. It is well known that twisted cohomology groups with coefficients in a generic rank one local system vanish except in the top degree, and bounded chambers form a basis of the remaining cohomology group. We determine precisely when this phenomenon happens for two-dimensional arrangements.
The Tutte polynomial is originally a bivariate polynomial which enumerates the colorings of a graph and of its dual graph. Ardila extended in 2007 the definition of the Tutte polynomial on the real hyperplane arrangements. He particularly computed the Tutte polynomials of the hyperplane arrangements associated to the classical Weyl groups. Those associated to the exceptional Weyl groups were computed by De Concini and Procesi one year later. This article has two objectives: On one side, we extend the Tutte polynomial computing to the complex hyperplane arrangements. On the other side, we intro…
We describe an explicit semi-algebraic partition for the complement of a real hyperplane arrangement such that each piece is contractible and so that the pieces form a basis of Borel-Moore homology. We also give an explicit correspondence between the de Rham cohomology and the Borel-Moore homology.
We extend the Billera-Ehrenborg-Readdy map between the intersection lattice and face lattice of a central hyperplane arrangement to affine and toric hyperplane arrangements. For arrangements on the torus, we also generalize Zaslavsky's fundamental results on the number of regions.
We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.
In this article, we study the weak and strong Lefschetz properties, and the related notion of almost revlex ideal, in the non-Artinian case, proving that several results known in the Artinian case hold also in this more general setting. We then apply the obtained results to the study of the Jacobian algebra of hyperplane arrangements.
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…
One of the most important invariants in singularity theory is the Hodge spectrum. Calculating the Hodge spectrum is a difficult task and formulas exist for only a few cases. In this article the main result is the formula for reduced hyperplane arrangements in four variables.
This paper studies \emph{Dirichlet arrangements}, a generalization of graphic hyperplane arrangements arising from electrical networks and order polytopes of finite posets. We generalize descriptions of combinatorial features of graphic arrangements to Dirichlet arrangements, including characteristic polynomials and supersolvability. We apply these results to visibility sets of order polytopes and fixed-energy harmonic functions on electrical networks.
The Tutte polynomial is a fundamental invariant associated to a graph, matroid, vector arrangement, or hyperplane arrangement. This short survey focuses on some of the most important results on Tutte polynomials of hyperplane arrangements. We show that many enumerative, algebraic, geometric, and topological invariants of a hyperplane arrangement can be expressed in terms of its Tutte polynomial. We also show that, even if one is only interested in computing the Tutte polynomial of a graph or a matroid, the theory of hyperplane arrangements provides a powerful finite field method for this compu…
We give a complete formula for the characteristic polynomial of hyperplane arrangements $\mathcal J_n$ consisting of the hyperplanes $x_i+x_j=1$, $x_k=0$, $x_l=1$, $ 1\leq i, j, k, l\leq n$. The formula is obtained by associating hyperplane arrangements with graphs, and then enumerating central graphs via generating functions for the number of bipartite graphs of given order, size and number of connected components.
