ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let L1(n)L_1(n) denote the set of vertices of local simplex dimension 11 in the partition graph on partitions of nn. The two antenna vertices are the partitions (n)(n) and (1n)(1^n).

Antenna-vertex conjecture. For every n≥4n\geq 4, the only vertices of local simplex dimension 11 are the two antenna vertices:

(n),(1n).(n),\qquad (1^n).

Equivalently,

L1(n)={(n),(1n)}.L_1(n)=\{(n),(1^n)\}.

Computations show that ∣L1(n)∣=2|L_1(n)|=2 for 4≤n≤304\leq n\leq 30, with these two vertices precisely the antenna vertices. The conjecture asserts that this stable pattern persists for all n≥4n\geq 4.

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.