Triangular threshold conjecture for simplex layers in the partition graph
Statement
Let be the partition graph, let be its clique complex, let denote the vertices of local simplex dimension , let be the maximal local simplex dimension, and let be the least for which the layer is nonempty. Triangular threshold conjecture. For every ,
Equivalently,
The formula is suggested by exhaustive computation for and predicts the first appearance of successive simplex layers through triangular-number thresholds; its validity for all 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.