Freeness of hyperplane arrangements between Boolean arrangements and Weyl arrangements of type \(B_{\ell}\) (Q783056)

In this nicely written paper the authors study the freeness of signed-graphic arrangements (Weyl subarrangements of type \(B\)). Let \(\mathbb{K}\) be an arbitrary field, \(S = \mathbb{K}[x_{1}, \dots, x_{\ell}]\), and let \(\mathcal{A}\) be a central arrangement in the \(\ell\)-dimensional vector space \(\mathbb{K}^{\ell}\). Denote by \(\chi(\mathcal{A};t)\) the characteristic polynomial of \(\mathcal{A}\). We define the module of logarithmic derivations for \(\mathcal{A}\) by \[ D(\mathcal{A}) = \{ \theta \in\mathrm{Der}(S) : \theta(\alpha_{H}) \in \alpha_{H}\cdot S \text{ for any hyperplane } H \in \mathcal{A}\}, \] where \(\alpha_{H}\) denotes a defining linear form of \(H \in \mathcal{A}\). We say that \(\mathcal{A}\) is free if \(D(\mathcal{A})\) is a free \(S\)-module. For each hyperplane \(H \in \mathcal{A}\) we define the restriction \(\mathcal{A}^{H}\) by \[ \mathcal{A}^{H} = \{ H \cap K : K \in \mathcal{A} \setminus \{H\}\}. \] Now we can define recursively the divisional freeness, namely \begin{itemize} \item[i)] the empty arrangement \(\Phi_{\ell}\) is divisionally free; \item[ii)] if there exists \(H \in \mathcal{A}\) such that \(\mathcal{A}^{H}\) is divisionally free and \(\chi(\mathcal{A}^{H};t)\) divides \(\chi(\mathcal{A};t)\), then \(\mathcal{A}\) is divisionally free. \end{itemize} Let us consider a signed graph \(G = (G^{+},G^{-})\), where \(G^{+} = (V_{G},E_{G}^{+})\) and \(G^{-} = (V_{G},E_{G}^{-})\) are simple graphs on a common set of vertices \(V_{G}\) -- here we de not consider graphs with loops, half edges, etc. Let \(\mathbb{K}\) be a field of characteristic zero. For each signed graph \(G\) on the vertex set \(\{1, \dots, \ell\}\) we define the signed-graphic arrangement \(\mathcal{A}(G)\) in the space \(\mathbb{K}^{\ell}\) by \[ \mathcal{A}(G) = \{ x_{i}=0 : 1 \leq i \leq \ell \} \cup\{ x_{i} - x_{j} = 0 : \{i,j\} \in E_{G}^{+}\} \cup \{ x_{i} + x_{j} = 0 : \{i,j\} \in E_{G}^{-}\}. \] Note that a signed-graphic arrangements \(\mathcal{A}(G)\) is a Weyl subarrangement of type \(B\) containing a Boolean arrangement. Here is the main result of the paper under review. Main Result. Let \(G\) be a signed graph. Then the following conditions are equivalent: \begin{itemize} \item[1)] \(G\) is balanced chordal, has no induced subgraphs isomorphic to unbalanced cycles of length three or more, and it does not induces subgraphs which are switching equivalent to the graphs presented in Figure 1 in the paper; \item[2)] \(\mathcal{A}(G)\) is divisionally free; \item[3)] \(\mathcal{A}(G)\) is free. \end{itemize}