[Paper Review] Reduction method for linear systems of plane curves with base fat points

Marcin Dumnicki|ArXiv.org|Jun 28, 2006

Algebraic Geometry and Number Theory21 citations

TL;DR

This paper introduces a novel 'diagram cutting' method to prove non-speciality of linear systems of plane curves with base fat points, using matrix representations of differential conditions. The method enables algorithmic verification of non-speciality and confirms the Hirschowitz–Harbourne Conjecture for homogeneous systems with multiplicities up to 42.

ABSTRACT

In the paper we develop a new method of proving non-speciality of a linear system with base fat points in general position. Using this method we show that the Hirschowitz-Harbourne Conjecture holds for systems with base points of equal multiplicity bounded by 42.

Motivation & Objective

• To develop a theoretical and algorithmic method for proving non-speciality of linear systems of plane curves with base fat points in general position.
• To provide a systematic approach to verify the Hirschowitz–Harbourne Conjecture for homogeneous systems with bounded multiplicities.
• To reduce the verification of non-speciality for large families of systems to checking only finitely many cases via diagram cutting.
• To establish that the Hirschowitz–Harbourne Conjecture holds for homogeneous systems with multiplicities ≤ 42 using a combination of theoretical reduction and computational verification.

Proposed method

• The method uses a matrix representation $ M(L) $ whose entries are differential operators evaluated at general points, encoding the vanishing conditions of curves at fat points.
• The dimension of the linear system is computed as $ \dim L = \#D - \operatorname{rank} M(L) - 1 $, linking linear algebra to geometric non-speciality.
• The 'diagram cutting' technique systematically reduces the diagram $ D $ of monomial exponents by removing rows and columns corresponding to redundant conditions.
• The method allows algorithmic testing of non-speciality by checking rank conditions on the matrix $ M(L) $, with results verifiable by hand after computation.
• Theoretical reduction ensures that for homogeneous multiplicities $ m \leq 42 $, it suffices to verify only finitely many systems to confirm the conjecture.
• A computer program is used to verify the conjecture for all homogeneous systems with $ m \leq 42 $, leveraging the diagram cutting procedure.

Experimental results

Research questions

• RQ1 Can a systematic method be developed to prove non-speciality of linear systems of plane curves with base fat points?
• RQ2 Does the Hirschowitz–Harbourne Conjecture hold for all homogeneous systems with multiplicities up to 42?
• RQ3 Can the number of cases needed to verify the conjecture for bounded multiplicities be reduced to a finite set using theoretical reduction?
• RQ4 To what extent can the non-speciality of such systems be verified algorithmically using matrix rank computations?
• RQ5 Can the diagram cutting method be used to verify the conjecture for higher multiplicities with computational assistance?

Key findings

• The diagram cutting method provides a theoretical and algorithmic framework to prove non-speciality of linear systems with base fat points.
• The method reduces the problem of verifying non-speciality to checking only finitely many systems for any bounded multiplicity.
• The Hirschowitz–Harbourne Conjecture is confirmed to hold for all homogeneous systems with multiplicities $ m \leq 42 $, using both theoretical reduction and computational verification.
• The dimension of a linear system $ \mathcal{L}_D(m_1,\dots,m_r) $ is determined by the rank of a matrix $ M(L) $ encoding differential conditions at the fat points.
• The method enables verification of non-speciality results that are computationally intensive but can be checked by hand after algorithmic computation.
• The approach establishes that for homogeneous systems with $ m \leq 42 $, the expected dimension matches the actual dimension, confirming non-speciality.