ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each positive integer dd, let (α1,α2,…,αed−1)(\alpha_1,\alpha_2,\ldots,\alpha_{e_d-1}) be the saturation sequence, and let

S(d)=max⁡{α1,α2,…,αed−1}.\mathfrak S(d)=\max\{\alpha_1,\alpha_2,\ldots,\alpha_{e_d-1}\}.

Monotonicity conjecture. The saturation sequence is non-increasing:

α1⩾α2⩾⋯⩾αed−1.\alpha_1\geqslant\alpha_2\geqslant\cdots\geqslant\alpha_{e_d-1}.

If true, this would imply that S(d)=α1\mathfrak S(d)=\alpha_1. The conjecture is presented as an open question, and no progress is reported in the source.

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.