Smallest Kochen-Specker vector set in three dimensions
14No. 1,762 in all physics · No. 99 in Quantum Information and Foundations
This text mentions work from 2024 on. Those parts were partly written without a live literature search and have not been checked by an editor yet.
A Kochen-Specker set in $R^3$ is a finite set of vectors admitting no $0/1$ assignment in which every orthogonal triple has exactly one 1 and no two orthogonal vectors are both 1. Determine the minimum size $n_{\min}$; known $24 \le n_{\min} \le 31$ (lower bound by SAT solving with computer algebra, Li, Bright and Ganesh, arXiv:2306.13319, and independently by Kirchweger, Peitl and Szeider, 2023; upper bound from the 31-vector Conway-Kochen set).
What would settle it
An exhaustive, computer-certified search of orthogonality graphs with 24 to 30 vertices, or an explicit smaller set.
Status in the literature
Unverified note: it names recent work and was partly written without a live literature search; it awaits a check by an editor.
Lean-checked certificates for the geometric half of the 24-vector bound appeared in July 2026 (arXiv:2607.26413); the bound itself is unchanged.
No solutions, ideas or subproblems yet.
Details, signature and history
- Kind
- Well-posed question
- Answer
- Value
- Topic review
- Budroni, Cabello, Guhne, Kleinmann, Larsson, Kochen-Specker contextuality, Reviews of Modern Physics, 2022. Link
- Record
- Revision 1 · imported from the seed collection · compiled by AI, not yet reviewed by an editor
Proof
- Fingerprint
- 0be8862eefb7…
- Public log
- Entry 1,985, in checkpoint 2,123
- In the log by
- Block 969,698, 2026-10-03
This text was in the PubPhys log by that date. The date says nothing about when the problem was first posed.
Comments (0)
Comments are not records: they are not signed, stamped or logged. How comments work
No comments yet.
Sign in to comment.