Pith. sign in

REVIEW 1 cited by

Line and rational curve arrangements, and Walther's inequality

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1803.05386 v4 pith:VEO2IHYI submitted 2018-03-14 math.AG math.AC

classification math.AGmath.AC
keywords arrangementslinelinesarrangementnumberonlyrationalresult
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Addition-deletion results for the minimal degree of logarithmic derivations of arrangements

    math.AG 2019-08 conditional novelty 7.0 of 10

    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.

Pith tools