Simplicial-tree characterisation from an intermediate face number
Statement
Let , let be the number of vertices, and let be a pure -simplicial complex. For some , an -simplicial cycle sequence is the cycle-sequence notion used in the paper, and denotes the number of -simplices of . The simplicial-tree conjecture. The complex is a simplicial tree if and only if it satisfies all three conditions: it has no -simplicial cycle sequences for some ; for some ,
and
The conjecture asks whether the top-dimensional face-count condition in the preceding theorem can be replaced by knowledge of an intermediate face number. The authors state that they have neither a proof nor a counterexample.
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.