On supersolvable and nearly supersolvable line arrangements

From MaRDI portal
Publication:2279154

DOI10.1007/S10801-018-0859-6zbMATH Open1437.14037arXiv1712.03885OpenAlexW2962894967WikidataQ128764053 ScholiaQ128764053MaRDI QIDQ2279154FDOQ2279154


Authors: Gabriel Sticlaru, Alexandru Dimca Edit this on Wikidata


Publication date: 12 December 2019

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Abstract: We introduce a new class of line arrangements in the projective plane, called nearly supersolvable, and show that any arrangement in this class is either free or nearly free. More precisely, we show that the minimal degree of a Jacobian syzygy for the defining equation of the line arrangement, which is a subtle algebraic invariant, is determined in this case by the combinatorics. When such a line arrangement is nearly free, we discuss the splitting types and the jumping lines of the associated rank two vector bundle, as well as the corresponding jumping points, introduced recently by S. Marchesi and J. Vall`es. As a by-product of our results, we get a version of the Slope Problem, looking for lower bounds on the number of slopes of the lines determined by n points in the affine plane over the real or the complex numbers as well.


Full work available at URL: https://arxiv.org/abs/1712.03885




Recommendations




Cites Work


Cited In (11)





This page was built for publication: On supersolvable and nearly supersolvable line arrangements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279154)