Skip to main content
QUICK REVIEW

[Paper Review] Limit linear systems and applications

Joaquím Roé|arXiv (Cornell University)|Feb 10, 2006
Polynomial and algebraic computation27 references20 citations
TL;DR

This paper establishes that linear systems of curves with equimultiple base points in the plane are regular when the number of points $ n $ satisfies $ n \geq 4e^2 $, using a novel method of computing limit linear systems to bypass limitations of classical specialization techniques. The key contribution is a significant improvement over prior bounds, reducing the required number of points from exponential in $ e $ to quadratic, and proving regularity for all degrees $ d $ in this regime.

ABSTRACT

A system of plane curves defined by prescribing n points of multiplicity m in general position is regular if n > (2m)^2. The proof uses computation of limits of linear systems acquiring fixed divisors, an interesting problem in itself.

Motivation & Objective

  • To establish regularity of linear systems of curves with $ n $ base points of multiplicity $ e $ in general position in $ \mathbb{P}^2 $, for all degrees $ d $.
  • To overcome the limitations of classical specialization techniques in interpolation problems by introducing a systematic method for computing limit linear systems.
  • To prove that regularity holds when $ n \geq 4e^2 $, significantly improving on prior exponential bounds.
  • To provide a framework applicable to general linear systems with fixed base loci, extending beyond equimultiple cases.

Proposed method

  • Uses limit linear systems in the Grassmannian to analyze degenerations of linear systems as points approach a fixed divisor.
  • Applies a refined version of the Horace method by constructing intermediate interpolation problems that preserve expected dimension and allow inductive arguments.
  • Employs semicontinuity and degeneration techniques to reduce the problem to checking maximal rank of restriction maps on degenerate schemes.
  • Introduces a recursive reduction process via blow-ups and divisor subtraction, tracking dimensions through successive layers of the limit system.
  • Applies inequalities involving lengths of sheaf cohomology and intersection numbers to bound the behavior of limit systems.
  • Uses a calculus-based verification to confirm that the derived inequality (21) holds under the condition $ n \geq 4e^2 $.

Experimental results

Research questions

  • RQ1Under what conditions on $ n $ and $ e $ is the linear system of curves of degree $ d $ with multiplicity $ e $ at $ n $ general points in $ \mathbb{P}^2 $ regular for all $ d $?
  • RQ2Can the classical Horace method be systematically enhanced to avoid failure in degenerate cases where the restriction map does not have maximal rank?
  • RQ3What is the minimal number of points $ n $ such that regularity holds for all $ d $ in the equimultiple case, and how does it compare to known conjectures?
  • RQ4How can limit linear systems be computed and used to prove maximal rank in general position when standard specialization fails?

Key findings

  • The linear system of curves of degree $ d $ with multiplicity at least $ e $ at $ n $ general points in $ \mathbb{P}^2 $ is regular whenever $ n \geq 4e^2 $.
  • This bound improves upon the previous best result by Alexander and Hirschowitz, which required $ f(e) \sim \exp(\exp(e)) $, reducing it to a quadratic dependence on $ e $.
  • The proof establishes regularity for all degrees $ d $, not just in the stable or empty regime, under the given condition.
  • The method successfully avoids the failure of classical specialization by constructing intermediate systems with maximal rank, enabling inductive proof of regularity.
  • The result supports the Harbourne–Hirschowitz and Nagata conjectures in the equimultiple case, particularly for $ n \geq 4e^2 $.
  • Évain’s result on square numbers of points is reproven and extended using the same framework, confirming regularity for $ n = s^2 $ when $ e > s/2 $.

Better researchstarts right now

From reading papers to final review, dramatically reduce your research time.

No credit card · Free plan available

This review was created by AI and reviewed by human editors.