An asymptotic version of Dumnicki's algorithm for linear systems in $\mathbb{CP}^2$

Mathematics – Algebraic Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

14 pages, 5 figures, references added

Scientific paper

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

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

An asymptotic version of Dumnicki's algorithm for linear systems in $\mathbb{CP}^2$ does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An asymptotic version of Dumnicki's algorithm for linear systems in $\mathbb{CP}^2$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An asymptotic version of Dumnicki's algorithm for linear systems in $\mathbb{CP}^2$ will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-691410

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.