ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let dd and nn be positive integers such that

(nd+1)≥dn−(d+12).\binom{n}{d+1} \ge dn - \binom{d+1}{2}.

The complete (d+1)(d+1)-uniform hypergraph is generically circumsphere rigid in dimension dd if its circumsphere framework is rigid for generic point configurations. Generic circumsphere rigidity conjecture. Under this numerical condition, the complete (d+1)(d+1)-uniform hypergraph is generically circumsphere rigid in dimension dd. This conjecture proposes that the complete hypergraph has enough circumsphere constraints to be rigid whenever the number of hyperedges meets the stated dimension-count inequality; its resolution is not given in the source.

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.