ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥1n\geq 1, let pp be the number of vertices, and let KK be a pure nn-simplicial complex. For some 0≤m≤n−10\leq m\leq n-1, an (m,n)(m,n)-simplicial cycle sequence is the cycle-sequence notion used in the paper, and αk(K)\alpha_k(K) denotes the number of kk-simplices of KK. The simplicial-tree conjecture. The complex KK is a simplicial tree if and only if it satisfies all three conditions: it has no (m,n)(m,n)-simplicial cycle sequences for some 0≤m≤n−10\leq m\leq n-1; for some 1≤k≤n−11\leq k\leq n-1,

αk(K)=(p−n)(nk)+(nk+1);\alpha_k(K)=(p-n)\binom{n}{k}+\binom{n}{k+1};

and

αn(K)=p−n.\alpha_n(K)=p-n.

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 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.