ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each positive integer dd, let (α1,…,αed−1)(\alpha_1,\ldots,\alpha_{e_d-1}) be the saturation sequence of the rational normal curve of degree dd. Terminal-3 conjecture. For every positive integer ss, there exists an integer NsN_s such that, for all d⩾Nsd\geqslant N_s, at least the last ss entries of the saturation sequence are equal to 33:

αed−s=αed−s+1=⋯=αed−1=3.\alpha_{e_d-s}=\alpha_{e_d-s+1}=\cdots=\alpha_{e_d-1}=3.

The paper proves this phenomenon for s⩽8s\leqslant8 by explicit determinant calculations, but the assertion for arbitrary positive integers ss remains open.

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.