Nearly free curves and arrangements: a vector bundle point of view

Over the past forty years many papers have studied logarithmic sheaves associated to reduced divisors, in particular logarithmic bundles associated to plane curves. An interesting family of these curves are the so-called free ones for which the associated logarithmic sheaf is the direct sum of two line bundles. Terao conjectured thirty years ago that when a curve is a finite set of distinct lines (i.e. a line arrangement) its freeness depends solely on its combinatorics, but this has only been proved for sets of up to 12 lines. In looking for a counter-example to Terao's conjecture, the nearly free curves introduced by Dimca and Sticlaru arise naturally. We prove here that the logarithmic bundle associated to a nearly free curve possesses a minimal non-zero section that vanishes on one single point, P say, called the jumping point, and that this characterises the bundle. We then give a precise description of the behaviour of P. Based on detailed examples we then show that the position of P relative to its corresponding nearly free arrangement of lines may or may not be a combinatorial invariant, depending on the chosen combinatoricsCONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO - CNPQFUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULO - FAPESP303075/2017-12017/03487-9; 2018/08524-