An asymptotic version of Dumnicki's algorithm for linear systems in CP^2
From MaRDI portal
Publication:956702
Abstract: Using Dumnicki's approach to showing non-specialty of linear systems consisting of plane curves with prescribed multiplicities in sufficiently general points on we develop an asymptotic method to determine lower bounds for Seshadri constants of general points on . With this method we prove the lower bound 4/13 for 10 general points on .
Recommendations
- An algorithm to bound the regularity and nonemptiness of linear systems in \(\mathbb P^n\)
- scientific article; zbMATH DE number 3961040
- A new algorithm for computing the asymptotic solutions of a class of linear differential systems
- \(\mathcal{L}\)-algorithm for approximation of Diophantine systems of linear forms
- Asymptotics of linear systems, with connections to line arrangements
- Systems of linear equations over \(\mathbb{F}_2\) and problems parameterized above average
- The L1-version of the Diliberto–Straus algorithm in C(T × S)
- ALGORITHM 635
- Asymptotic solutions of nondiagonal linear difference systems
Cites work
- scientific article; zbMATH DE number 1258343 (Why is no real title available?)
- A bound for Seshadri constants on ℙ2
- Computing multi-point seshadri constants on \(\mathbb{P}^2\)
- Constructing new ample divisors out of old ones
- Curves in \(P^ 2\) and symplectic packings
- General blow-ups of the projective plane
- Linear systems with multiple base points in ℙ2
- Multipoint Seshadri constants on \(\mathbb P^2\)
- New effective bounds on the dimension of a linear system in \(\mathbb P^2\)
- On the 14-th Problem of Hilbert
- Seshadri constants and very ample divisors on algebraic surfaces
- The Segre and Harbourne-Hirschowitz conjectures
Cited in
(5)- Computing multi-point seshadri constants on \(\mathbb{P}^2\)
- Ciliberto-Miranda degenerations of \(\mathbb {CP}^2\) blown up in 10 points
- Mini-workshop: Linear series on algebraic varieties. Abstracts from the mini-workshop held October 3rd -- October 9th.
- New methods for determining speciality of linear systems based at fat points in \(\mathbb P^n\)
- The L1-version of the Diliberto–Straus algorithm in C(T × S)
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)