ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GnG_n be the partition graph, let KnK_n be its clique complex, let Lr(n)L_r(n) denote the vertices of local simplex dimension rr, let Δ(n)\Delta(n) be the maximal local simplex dimension, and let τ(r)\tau(r) be the least nn for which the layer Lr(n)L_r(n) is nonempty. Triangular threshold conjecture. For every r≥0r\ge 0,

τ(r)=1+r(r+1)2.\tau(r)=1+\frac{r(r+1)}{2}.

Equivalently,

Δ(n)=max⁡{r: 1+r(r+1)2≤n}.\Delta(n)=\max\Bigl\{r:\ 1+\frac{r(r+1)}{2}\le n\Bigr\}.

The formula is suggested by exhaustive computation for n≤30n\le 30 and predicts the first appearance of successive simplex layers through triangular-number thresholds; its validity for all rr 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.