← All problems

Maximal non-Kochen–Specker set conjecture

2 years old · traced to

Let a non-Kochen–Specker set in dimension dd be a measurable subset A⊆Sd−1A\subseteq S^{d-1} admitting a valuation map v:A→{0,1}v:A\to\{0,1\} such that v(−n)=v(n)v(-n)=v(n), every mutually orthogonal collection has valuation sum at most 11, and every set of dd mutually orthogonal directions has valuation sum 11. In the construction discussed, N=N0∪N1⊆S2N=N_0\cup N_1\subseteq S^2 is a non-Kochen–Specker set, with normalized measure ∣N∣=2−2+2ln⁡2π≈0.8978|N|=2-\sqrt{2}+\frac{\sqrt{2}\ln 2}{\pi}\approx0.8978. Maximal non-Kochen–Specker set conjecture. NN is the non-Kochen–Specker set of largest measure. The preceding calculation establishes only the lower bound ∣Nmax∣≥2−2+2ln⁡2π≈0.8978|N_{\mathrm{max}}|\geq 2-\sqrt{2}+\frac{\sqrt{2}\ln 2}{\pi}\approx0.8978; whether this particular set is globally maximal is not resolved in the supplied context.

References
  1. Tom Williams and Andrei Constantin, “Maximal Non-Kochen-Specker Sets and a Lower Bound on the Size of Kochen-Specker Sets”, arXiv:2403.05230 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.