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.
Abe, Deletion theorem and combinatorics of hyperplane arran gements
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.