Freeness for 13 lines arrangements is combinatorial (Q2319729)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Freeness for 13 lines arrangements is combinatorial
scientific article

    Statements

    Freeness for 13 lines arrangements is combinatorial (English)
    0 references
    0 references
    0 references
    0 references
    20 August 2019
    0 references
    Let $\mathcal{A} = \{\ell_{1}, \dots, \ell_{d}\} \subseteq \mathbb{P}^{2}_{\mathbb{C}}$ be an arrangement of $d$ lines. We denote by $L(\mathcal{A})$ the intersection lattice of $\mathcal{A}$ which is the lattice of all intersections of various subsets of the set of lines of $\mathcal{A}$ ordered by reverse inclusion. We say that two line arrangements $\mathcal{A}, \mathcal{B}$ are combinatorially equivalent if the corresponding intersection posets $L(\mathcal{A})$, $L(\mathcal{B})$ are isomorphic. We denote by $f$ the defining polynomial of $\mathcal{A}$, i.e., if $\ell_{i}=V(f_{i})$, then $f = \prod_{i=1}^{d} f_{i}$. Now we define the module $D(\mathcal{A})$ of all $\mathbb{C}$-derivations of $S=\mathbb{C}[x,y,z]$, denoted by $\mathrm{Der}(S)$, preserving $\mathcal{A}$, namely \[ D(\mathcal{A}) = \{ \theta \in \mathrm{Der}(S) : \theta(f_{i}) \in f_{i}\cdot S \text{ for all } i\in \{1, \dots, d\}\}. \] We say that $\mathcal{A}$ is free if the associated $\mathbb{C}$-module $D(\mathcal{A})$ is free. The celebrated Terao's conjecture predicts that if $\mathcal{A}$, $\mathcal{B}$ are two complex line arrangements such that $\mathcal{A}$ is free and the intersection lattices $L(\mathcal{A})$, $L(\mathcal{B})$ are isomorphic, then $\mathcal{B}$ is also free. This conjecture is widely open and still attracts many researchers in the field. The main result of the paper tells us that Terao's conjecture holds for complex line arrangements with $d\leq 13$.
    0 references
    0 references
    line arrangement
    0 references
    free arrangement
    0 references
    Terao's conjecture
    0 references
    intersection lattice
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers