ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Conjecture 1. [CLV22, Conjecture 1.1] All but finitely many BN triples (d, g, r) with g \geq 2 are stable. In fact, one may conjecture that except for the triples in Examples 1 and 2, every BN triple with g \geq 2 is stable (at least in characteristic 0). The following two theorems provide evidence for the conjecture. r k 1.1] Let C \subset P be a general BN-curve of degree d Theorem 5. [CG23, jTheorem 2 and genus g. Let u = (r+1) 2(r−1) . Let k be the integer such that (k−1)u < g−1 \leq ku. Then NC/Pr is semistable if one of the following holds: (1) g = 1, † 2 £ (2) g \geq r−1 5r −7r 2 Ä + 2 + 2(r−1) r(r − 1), 2 ä (3) d \geq min g + r4 + 2r − 3, (k + 1)(r + 1), (g − 1)(2r − 3) + r + 1 Let b2 (r) be least integer such that for all d \geq b2 (r), there exists positive integers d1 , d2 such that d = d1 + d2 , d1 , d2 \geq r + 1 and gcd(r − 1, 2d1 + 1) = 1. If p \geq 5 is the smallest prime number that does not divide r − 1, then b2 (r) \leq 2r + p−1 2 . In general, b2 (r) = 2r + O(log(r)) and b2 (r) \leq 5r−3 2 . In fact, if r \geq 1636, then b2 (r) \leq 2.01r + 2.015. Then preserving the notation from Theorem 5, we have: Theorem 6. [CG23, Theorem 1.2] Let C \subset Pr be a general BN-curve of degree d and genus g \geq 2. Then NC/Pr is stable if one of the following holds: l m 2(r+1)b2 (r)+3r 2 −13r−2 (1) g \geq r−12 + 3 + 2(r−1) r(r − 1), Ä ä r2 (2) d \geq b2 (r) + min g + 4 + r − 5, b2 (r) + (k − 2)(r + 1), (g − 1)(2r − 3) .

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.