← All problems

The maximal rank conjecture for general Brill–Noether curves

8 years old · documented by

Let g,r,d≥0g,r,d\geq 0, let XX be a general curve of genus gg, and let (L,V)({\mathscr L},V) be a general linear series of rank rr and degree dd on XX with ρ=g−(r+1)(r+g−d)≥0\rho=g-(r+1)(r+g-d)\geq 0. Assume that the series embeds XX as a nondegenerate curve in Pr\mathbb P^r, and for m≥2m\geq 2 consider the restriction map

Γ(Pr,O(m))⟶Γ(X,L⊗m).\Gamma(\mathbb P^r,\mathscr O(m))\longrightarrow \Gamma(X,\mathscr L^{\otimes m}).

Maximal Rank Conjecture. The rank of this restriction map is

min⁡{(r+mm),md+1−g},\min\left\{\binom{r+m}{m},md+1-g\right\},

so the dimension of its kernel, equivalently the dimension of the degree-mm homogeneous polynomials vanishing on the image of XX, is

max⁡{0,(r+mm)−(md+1−g)}.\max\left\{0,\binom{r+m}{m}-(md+1-g)\right\}.

This conjecture predicts that the restriction map has maximal possible rank, or equivalently that its kernel has minimal possible dimension. It gives the expected dimensions of the equations of a general Brill–Noether curve in every degree, extending the basic question about the defining equations of such curves.

Equivalent formulations
  1. Let C⊂PrC\subset \mathbb{P}^r be a general Brill–Noether curve, meaning a curve lying in the component of the Hilbert scheme dominating the moduli space of curves, and let mm be a positive integer. Maximal Rank Conjecture. The restriction map

    H0(OPr(m))→H0(OC(m))H^0(\mathcal{O}_{\mathbb{P}^r}(m))\to H^0(\mathcal{O}_C(m))

    is of maximal rank. This conjecture would determine the Hilbert function of a general curve in its embedding; the source does not indicate whether it has been resolved.

    source: Eric Larson, “The Maximal Rank Conjecture for Sections of Curves”, arXiv:1208.2730 (2018).

References
  1. Fu Liu, Brian Osserman, Montserrat Teixidor I Bigas and Naizhen Zhang, “Limit linear series and ranks of multiplication maps”, arXiv:1701.06592 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.