ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let α=(α1,α2,…,αm)\alpha=(\alpha_1,\alpha_2,\ldots,\alpha_m) be a ribbon with α1≥α2≥⋯≥αm\alpha_1\geq\alpha_2\geq\cdots\geq\alpha_m, where each αi≥2\alpha_i\geq2 and m≥3m\geq3. Let NjN_j denote the quantity defined in the necessary condition of the paper. Full equivalence class conjecture. The ribbon α\alpha has full equivalence class if and only if

Nj<∑i=j+1mαi−(m−j−2)N_j<\sum_{i=j+1}^m\alpha_i-(m-j-2)

for all 1≤j≤m−21\leq j\leq m-2. This conjectures that the necessary condition established in the paper is also sufficient; it is known for ribbons with three or four rows and has been verified computationally in the stated cases for five, six, and seven rows.

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.