Freeness of Signed Graphic Arrangements

: Freeness occupies an important position in the study of hyperplane arrangements. In this paper, we conclude the freeness of three special classes of signed graphic arrangements based on the addition–deletion theorem and Abe’s free path theory.


Introduction
It is known that the Coxeter arrangements are free; see V. I. Arnold [1,2], and K. Saito [3].This was generalized to the case of unitary reflection groups by H. Terao [4].T. Józefiak and B. E. Sagan [5] explicitly constructed the basic derivations of some classes of subarrangements of Coxeter arrangements.P. H. Edelman and V. Reiner [6] characterized the freeness and supersolvability of subarrangements between A n−1 and B n combinatorially.Stanley [7] characterized the freeness and supersolvabilitiy of graphic arrangements associated with chordal graphs.Abe [8] also gave the characteristic polynomial of a multiarrangement.T. Zaslavsky [9] described that graphic and sign-symmetric arrangements can be reduced to ordinary graph theory; arrangements that are neither graphic nor signsymmetric can also be handled, but they require a theory of signed graphs.At present, the graphic arrangements associated with signed graphs are still very active areas of research, especially the freeness of hyperplane arrangements (e.g., M. Yoshinaga [10], Ziegler [11] and Bailey [12]).In this paper, we focus on the freeness of signed graphic arrangements.
A hyperplane arrangement A is a collection of finite hyperplanes, H, which comprise the kernel of a linear form of variables x 1 , ..., x l in the vector space K l .A graph G = (V, E) is an ordered pair in which V = V G = {1, 2, ..., l} = [l], called the vertex set, and E = E G is called the edge set of G, which is the collection of two-element subsets of V.
A signed graph is a tuple G = (V G , E + G , E − G , L G ) [13] where (1) V G is a finite set called the set of vertices; (2) E + G is a subset of V G 2 called the set of positive edges; (3) E − G is a subset of V G 2 called the set of negative edges; (4) L G is a subset of V G called the set of loops.
Let G be a signed graph with l vertices, let K be a field, let V = K l , and let x 1 , ..., x l be a basis for the dual space V * .Associated with the signed graph G, the signed graphic arrangement A (G) in the l-dimensional vector space over K is defined as follows: where L is the loop set of the graph G; in this paper, we focus on the case of and we assume that L = ∅.
Some results for the freeness of signed graphic arrangements have been obtained.Suyama, Michele, and Tsujie [14] characterized the freeness of signed graphic arrangements corresponding to graphs in the case G + ⊇ G − , and they show that when the signed graph G with G + ⊇ G − , the arrangement A (G) is free if and only if A (G) is divisionally free or G is a balanced chordal.Michele and Tsujie [15] generalized this result, and they give a complete characterization for the freeness of arrangements between Boolean arrangements and Weyl arrangements of type B l in terms of signed graphs.However, there are many unknown results for the freeness of signed graphic arrangements.In this article, we characterized the freeness of three other kinds of signed graphic arrangements.The following theorems are our main results.
Theorem 1.For a signed graph G, denoted by V and E, the vertex set and the edge set, respectively, T is a chordal subgraph of G, E(T) ⊂ E + G , and E(G − T) = ∅.The signed graphic arrangement Theorem 2. If the signed graphic hyperplane arrangement A = A (G) satisfies the following conditions, then it is free. ( The graph G = T ∪ Q, T is a chordal graph, and E(T) , where e is an edge of K ′ 4 .
and the subgraph U is a cycle containing an odd number of negative edges.Then, the signed graphic hyperplane arrangement A = A (G) is free.
The organization of this article is as follows.In Section 2, we review some basic definitions and results of the hyperplane arrangement, including the combinatorial and algebraic properties, which are helpful for studying freeness.Some related examples and theorems are also shown in this section.In Section 3, we mainly characterize the freeness of four signed graphic arrangements, A (K 2 3 ), A (K 1 3 ), A (K ′ 4 ), and A (K ′ 4 \e); their corresponding graphs are the subgraphs in our main theorems.In Section 4, we focus on proving the main theorems.In Section 5, we raise some questions about the freeness of signed graphic arrangements for further research.

Preliminaries
In this section, we briefly review some basic definitions and results from [16].Let A be a finite hyperplane arrangement denoted by An arrangement A is central if the intersection of all hyperplanes is not empty, and L = L(A ) is a geometric lattice for central arrangements.We only discuss the central case in this paper since every signed graphic arrangement contains the origin as its center.
For an arrangement A , the meet of , where r is the rank function of L. An element X is called a modular element if it forms a modular pair with each Y ∈ L.
For an X ∈ L(A ), the localization of A at X ∈ A is the subarrangement and the restriction A X is the arrangement For a given hyperplane H ∈ A , we have a triple (A , A ′ , A ′′ ) of arrangements where The characteristic polynomial χ(A , t) of an arrangement A is defined by where µ(X) denotes the Möbius function of L(A ), defined recursively by For a vector space V, S = S(V * ) is the symmetric algebra of the dual space V * .Given a basis of V * , then S is isomorphic to a polynomial ring K[x 1 , ..., x l ].Denoted by Der(S), the module of derivations of S is Let A be an arrangement in V with the defining polynomial where H = ker(α H ). We define D(A ) as a module over the polynomial ring S as follows If D(A ) is a free S-module of rank l, we call the arrangement A a free arrangement.It is known that if A is free, there exists a homogeneous basis η 1 , ..., η l for D(A ) satisfying the following property: for each where f ij is zero or a homogeneous polynomial of the degree b j , the degree sequence b 1 , ..., b l is called the exponent of A and is denoted by exp A = (b 1 , ..., b l ).
According to Terao's factorization theorem [17], if A is a central and free arrangement with exp A = (b 1 , ..., b l ), then its characteristic polynomial χ(A , t) can be factorable as follows: This theorem can help us to distinguish whether some arrangements are free or not; in particular, the arrangement is not free if its characteristic polynomial is not factorable.Example 1.Let K n be a complete graph with n vertices; for any two vertices joined by an edge, the corresponding arrangement is called the braid arrangement, and it is free.The intersection of the partially ordered set L(A (K n )) is isomorphic to the partition lattice, and its characteristic polynomial can be calculated through its M öbius function; it is factorable as follows: People have found many other ways to study the freeness of a hyperplane arrangement.We will introduce the corresponding definitions and theorems in the following section.
An induction table between two free arrangements A and B is a sequence of free arrangements.
If an l-arrangement A has a maximal chain of modular elements, we then call A supersolvable; see [6].
An equivalent definition of the modular coatom is given in [18].A subarrangement A ′ is a modular coatom of an arrangement A if (1) For all hyperplane pairs H 1 , H 2 ∈ A − A ′ , there always exists a hyperplane An arrangement is supersolvable if A has an M-chain The following statements are known.
(2) If A is an arrangement associated with a chordal graph, then A is supersolvable [6].
We now give some properties of a signed graph [13].
For a given signed graph For a given signed graph G and a map σ : V G → {+, −}, we find a signed graph G ′ which has the same underlying graph and is equivalent to a permutation on the coordinates of G.If e = {i, j} ∈ E G , then sgn G ′ (e) = σ(i)sgn G (e)σ(j).We call G ′ the switching of G by σ and denote it as G σ .
If there exists a switching function σ such that G 2 = G σ 1 , we say they are switching equivalent and write Since switching is an equivalent relationship, switching operations classify signed graphs into different classes.In this paper, our discussion is always based on switching equivalence because the degrees of freeness of two switching-equivalent arrangements are same.For example, the following two graphs, K 4 in Figure 1 and K σ 4 in Figure 2, are switching equivalent, while the corresponding arrangements A (K 4 ) and A (K σ 4 ) are both free with the same factorable characteristic polynomials.The following theorems are used frequently in this paper.Abe and Yamaguchi gave a theorem on the free path [19].
and B are both free, then at least one of A 1 and A 2 is free.
Orlik and Terao gave the theorems as follows in [16].Theorem 7 (addition-deletion).Let (A , A ′ , A ′′ ) be a triple.Any two of the following statements imply the third.

Some Lemmas
In this section, we will give some lemmas regarding the signed graphic arrangements (see [9,20]) which help us prove our main results.Lemma 1.For the signed graph K 2 3 shown in Figure 3, its corresponding signed graphic hyperplane arrangement A (K 2 3 ) is free.Proof.The signed graphic hyperplane arrangement A (K 2 3 ) has a modular coatom A ′ (K 3 ) which is associated with Figure 4, and A ′ (K 3 ) is a braid arrangement and is supersolvable.Thus, the signed graphic hyperplane arrangement A (K 2 3 ) definitely is a supersolvable arrangement, and it is free.Remark 1.To show Terao's factorization theorem, we will calculate the characteristic polynomial of A (K 2 3 ) through its Hasse diagram of the lattice L(A (K 2 3 )) in Figure 5 below.The hyperplanes in A (K 2 3 ) are From the Hasse diagram, we can obtain the Möbius function of every element in L(A (K 2 3 )).For example, the element K 3 with a rank of 0 is 1, while µ( Finally, we can obtain its characteristic polynomial, 2 , which is factorable.Lemma 2. For the signed graph K 1  3 shown in Figure 6, the corresponding signed graphic hyperplane arrangement A (K 1 3 ) is free and supersolvable.Proof.According to Theorem 4 and Lemma 1, the arrangement A (K 1 3 ) is in the free path 3 ); the freeness of A (K 1 3 ) is obvious.And we can find a modular coatom A (K 12 ) (Figure 7).Therefore we have an M-chain of K 1 3 : Lemma 3.For the signed graph K ′ 4 shown in Figure 8, the hyperplane arrangement A (K ′ 4 ) is free.

Proof. The hyperplane arrangement
For hyperplane H 3 : 9), the restriction 3 ) in Figure 10) is Since A ′ (G 1 ) is an arrangement associated with a chordal graph, the triple (A , A ′ , A ′′ ) satisfies the conditions of the addition-deletion theorem, so A (K ′ 4 ) is free according to the addition-deletion theorem.Lemma 4. For the signed graph K ′ 4 \e shown in Figure 11, the corresponding signed graphic hyperplane arrangement A (K ′ 4 \e) is free.

Proof. The hyperplane arrangement
For hyperplane H 3 : 12), the restriction Since A ′ (G 2 ) is an arrangement associated with a chordal graph, the triple (A , A ′ , A ′′ ) satisfies the conditions of the addition-deletion theorem, so A (K ′ 4 \e) is free according to the addition-deletion theorem.

Proof of Main Results
In this section, we prove our main results.
Proof of Theorem 1.If the vertex v ∈ V(G − T) satisfies conditions (1) and ( 2), the graph G is obviously switching equivalent to a chordal graph, so we only need to prove (3).
Firstly, we prove the situation in which there is only one vertex v ∈ V(G − T) that satisfies condition (3).Assume the hyperplanes H 1 , H 2 correspond to the edges vv i , vv j , respectively; then, H 1 ∩ H 2 are contained in the hyperplane H 3 : x i − x j = 0 of A .Let A r−1 = A \{H 1 , H 2 }; then, A r−1 is a modular coatom of A , and we can obtain a modular coatom chain according to the same method.
We denote by A 0 the arrangement associated with G 0 in which G 0 has two cases.CASE 1.If the number of edges incident to the vertex v is even, we can finally obtain an isolated vertex of G 0 ; then, G 0 is a chordal graph.Therefore, A 0 is supersolvable, and A is also supersolvable and free.CASE 2. If the number of edges incident to the vertex v is odd, then there only exists a vertex u ∈ V(G 0 ) such that {vu} ∈ E(G 0 ).In this case, G 0 is switching equivalent to a chordal graph, so A 0 is supersolvable.Therefore, A is also supersolvable and free.
If there are more than one vertices in G − T satisfying condition (3), we can prove the freeness of A by induction using the number of such vertices in G − T.
Proof of Theorem 2. According to Theorem 7, for the hyperplane H associated with the negative edge, the deletion According to Lemmas 1 and 2, A ′′ (Q) is supersolvable, so we can obtain a modular coatom A (Q * ) of A ′′ (Q) by deleting two hyperplanes in A ′′ (Q) associated with two positive edges.For the the arrangement A ′′ (G), if we delete the same two hyperplanes, we can then obtain a modular coatom A (G * ) associated with the graph G * , which is switching equivalent to a chordal graph; then, A (G * ) is supersolvable., and we can obtain an M-chain of A ′′ (G), So, A ′′ (G) is supersolvable and free, and A is free by Theorem 7.
Next we will prove Theorem 3 through the signed graph Σ 1 (Figure 13) containing a cycle with 5 vertices.Proof of Theorem 3. Assume V G = {v 0 , v 1 , ..., v n }.Firstly, we consider n = 5 and T to be a triangle and prove that the arrangement A (Σ 1 ) associated with the graph Σ 1 in Figure 13 is free.For the hyperplane H that is associated with one negative edge, the deletion A ′ = A (Σ 1 ) − H is always associated with a chordal graph, and A (Σ 2 ) is a restriction of A (Σ 1 ) in which Σ 2 in Figure 14 is a restriction of the graph Σ 1 .According to Theorem 7, to prove that A (Σ 2 ) is free, it suffices to prove that A (Σ 1 ) is free.Similarly, for another hyperplane H ′ that is associated with the negative edge, the deletion A (Σ 2 ) − H is always associated with a chordal graph, and is a restriction of the graph Σ 2 .According to Lemma 4, the signed graphic hyperplane arrangement A (Σ 1 ) is free.When n ≥ 6 and T is a triangle, we can also conclude the freeness of A by the same deletions and restrictions.If T is not a triangle, then after the same process, the final arrangement we need to prove satisfies the condition of Theorem 2.
The characteristic polynomial of a free arrangement is factorable.When V G = {v 0 , v 1 , ..., v n } and T is a triangle, we calculate the characteristic polynomial of A , which is also factorable χ(A ) = (2t + 1)(t + 1) n .

Discussion
Since K. Saito [3] studied logarithmic vector fields and differential forms of hypersurfaces and defined their freeness in 1980, research on freeness has played an important role connecting the algebra, topology, combinatorics, and geometry of hyperplane arrangements.Although H. Terao, Abe, and others have obtained a large number of significant results, there are still many unknown facts.It is very fundamental and important to construct free arrangements.
In this article, we construct three kinds of signed graphic arrangements which can generalize the results on simple graphic arrangements.However, the necessary condition for the freeness of these signed graphic arrangements is still unknown.We conjecture that the necessary condition is related to the sufficient conditions in our theorems.In order to further study the algebraic and topological properties of the free signed graphic arrangements in this article, it is necessary but difficult to construct the basis of a derivation module D(A ).
Author Contributions: Z.J. and W.G.; writing-original draft preparation, W.G.; writing-review and editing; G.J.; offering supervision.All authors contributed to this work.All authors have read and agreed to the published version of the manuscript.
Funding: This research was funded by National Natural Science Foundation of China (No. 12201029).