On maximizing line arrangements in the complex plane (Q6541970)

The notion of maximizing curve arises in the construction of complex smooth projective surfaces with maximum Picard number and is due to \textit{U. Persson} [Math. Ann. 259, 287--312 (1982; Zbl 0466.14010)]. In this setting a remarkable role is played by the so-called simply singular curves \(C \subset \mathbb{P}^2\), namely reduced curves with only ADE singularities, since they produce rational double points at worst as singularities for the double cover branched along \(C\), and then one can consider the minimal resolution. For such a curve \(C\), the total Tjurina number \(\tau(C)\) is the sum over all singular points \(p \in\mathrm{Sing}(C)\) of the local Tjurina numbers \(\tau_p\), where for \(p=(0,0)\) and \(f \in\mathbb{P}[x,y]\) defining \(C\) locally at \(p\), \(\tau_p = \dim _{\mathbb{P}} \left(\mathbb{P}[x, y]/ \langle f, \frac{\partial f}{\partial x}, \frac{\partial f}{\partial y} \rangle \right)\). Then a reduced simply singular curve \(C \subset\mathbb{P}^2\) of degree \(n\) is maximizing if \(\tau(C) = 3m(m-1)+1\) or \(3m^2+1\), according to whether \(n=2m\) or \(2m+1\), respectively. The latter case has been recently considered by \textit{A. Dimca} and \textit{P. Pokora} in connection with another kind of relevant curves [Int. Math. Res. Not. 2023, No. 22, 19156--19183 (2023; Zbl 1543.14025)]. In the paper under review the author considers line arrangements and characterizes those which are maximizing both in odd and even degrees. In particular, for a line arrangement the condition of having ADE singularities means that it has only double ad triple intersections as singularities. So, let \(\mathcal L \subset\mathbb{P}^2\) be an arrangement of \(n\) lines, and let \(t_2\) and \(t_3\) denote the number of points where \(2\) or \(3\) lines meet respectively. The author proves that if \(\mathcal L\) is maximizing with \(n \geq 3\), then the vector \((n;t_2,t_3)\) can only be one of the following: \((3;0,1), (4;3,1), (6;3,4)\). The proof is purely combinatorial.