Minimal plus-one generated line arrangements with double and triple intersection points (Q6931019)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8092273
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal plus-one generated line arrangements with double and triple intersection points |
scientific article; zbMATH DE number 8092273 |
Statements
Minimal plus-one generated line arrangements with double and triple intersection points (English)
0 references
11 September 2025
0 references
Let \(S = \mathbb{C}[x,y,z]\) be the graded polynomial ring in three variables \(x,y,z\) and for \(f \in S\) we denote by \(J_{f}\) the Jacobian ideal associated with \(f\). We say that a reduced plane curve \(C\) is \(m\)-syzygy when the associated Milnor algebra \(M(f) :=S/J_{f}\) has the following minimal graded free resolution: \N\[\N0 \rightarrow \bigoplus_{i=1}^{m-2}S(-e_{i}) \rightarrow \bigoplus_{i=1}^{m}S(1-d - d_{i}) \rightarrow S^{3}(1-d)\rightarrow S \rightarrow M(f) \rightarrow 0\N\]\Nwith \(e_{1} \leq e_{2} \leq \ldots \leq e_{m-2}\) and \(1\leq d_{1} \leq \ldots \leq d_{m}\). The \(m\)-tuple \((d_{1}, \ldots, d_{m})\) is called the exponents of \(C\).\N\NA reduced plane curve \(C\) is called plus-one generated with the exponents \((d_{1}, d_{2}, d_{3})\) if \(C\) is \(3\)-syzygy such that \(d_{1}+d_{2}=d\). A plus-one generated curve \(C\) such that \(d_{3}-d_{2}=1\) is called a minimal plus-one generated curve. In the paper under review the author provides a complete ``weak-combinatorial'' classification of minimal plus-one generated line arrangements with only double and triple intersection points. More precisely, let \(\mathcal{A} \subset \mathbb{P}^{2}_{\mathbb{C}}\) be an arrangement of \(d\geq 3\) lines, then its weak-combinatorics is defined as follows: \N\[\NW(\mathcal{A}) = (d;t_{2}, \ldots ,t_{d}),\N\]\Nwhere \(t_{i}\) denotes the number of \(i\)-fold intersection points. The main result of the paper under review can be formulated as follows.\N\N{Main Theorem}. Let \(\mathcal{A} \subset \mathbb{P}^{2}_{\mathbb{C}}\) be an arrangement of \(d\) lines with only double and triple intersection points that is minimal plus-one generated. Then \(\mathcal{A}\) has one of the following weak-combinatorics: \N\[\NW(\mathcal{A}) = (d;t_{2},t_{3}) \in \{(6;9,2),(7;9,4),(8;7,7),(9;6,10)\}.\N\]
0 references
minimal plus-one generated curves
0 references
line arrangements
0 references
intersection points
0 references
weak-combinatorics
0 references