For line arrangements, the minimal degree of a logarithmic derivation changes predictably under adding or deleting one line, yielding new maximal Tjurina arrangements and a sharp n3≤5 combinatoriality threshold.
Line and rational curve arrangements, and Walther's inequality
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
There are two invariants associated to any line arrangement: the freeness defect $\nu(C)$ and an upper bound for it, denoted by $\nu'(C)$, coming from a recent result by Uli Walther. We show that $\nu'(C)$ is combinatorially determined, at least when the number of lines in $C$ is odd, while the same property is conjectural for $\nu(C)$. In addition, we conjecture that the equality $\nu(C)=\nu'(C)$ holds if and only if the essential arrangement $C$ of $d$ lines has either a point of multiplicity $d-1$, or has only double and triple points. We prove both conjectures in some cases, in particular when the number of lines is at most 10. We also extend a result by H. Schenck on the Castenuovo-Mumford regularity of line arrangements to arrangements of possibly singular rational curves.
fields
math.AG 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Addition-deletion results for the minimal degree of logarithmic derivations of arrangements
For line arrangements, the minimal degree of a logarithmic derivation changes predictably under adding or deleting one line, yielding new maximal Tjurina arrangements and a sharp n3≤5 combinatoriality threshold.