An asymptotic version of Dumnicki's algorithm for linear systems in \mathbbCP²

2008/01/18 by Thomas Eckl, Eckl, Thomas
Computer Science · Engineering · Mathematics · #14C20 #14J26 #Advanced Numerical Analysis Techniques #Algebraic Geometry (math.AG) #Commutative Algebra and Its Applications #FOS: Mathematics #Polynomial and algebraic computation

paper · pdf · doi:10.48550/arxiv.0801.2926

openalex publication_date 2008/01/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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 ℙ².

Citations

• Reduction method for linear systems of plane curves with base fat points

Related

• Ciliberto-Miranda degenerations of \mathbbCP² blown up in 10 points
• Linear systems with multiple base points in P2
• Regularity and non-emptyness of linear systems in \mathbb Pⁿ
• New methods for determining speciality of linear systems based at fat points in Pⁿ
• Computing multi-point Seshadri constants on P2