An asymptotic version of Dumnicki's algorithm for linear systems in CP^2

From MaRDI portal
Publication:956702

DOI10.1007/S10711-008-9291-8zbMATH Open1153.14009arXiv0801.2926OpenAlexW2087960518MaRDI QIDQ956702FDOQ956702


Authors: Thomas Eckl Edit this on Wikidata


Publication date: 25 November 2008

Published in: Geometriae Dedicata (Search for Journal in Brave)

Abstract: Using Dumnicki's approach to showing non-specialty of linear systems consisting of plane curves with prescribed multiplicities in sufficiently general points on mathbbP2 we develop an asymptotic method to determine lower bounds for Seshadri constants of general points on mathbbP2. With this method we prove the lower bound 4/13 for 10 general points on mathbbP2.


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




Recommendations




Cites Work


Cited In (5)





This page was built for publication: An asymptotic version of Dumnicki's algorithm for linear systems in \({\mathbb{CP}^2}\)

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