相关论文: Coloring the rational quantum sphere and the Koche…

In 1973, Fisk proved that any $4$-coloring of a $3$-colorable triangulation of the $2$-sphere can be obtained from any $3$-coloring by a sequence of Kempe-changes. On the other hand, in the case where we are only allowed to recolor a single…

For the four-color theorem that has been developed over one and half centuries, all people believe it right but without complete proof convincing all1-3. Former proofs are to find the basic four-colorable patterns on a planar graph to…

The Kochen-Specker (KS) theorem is a central result in quantum theory and has applications in quantum information. Its proof requires several yes-no tests that can be grouped in contexts or subsets of jointly measurable tests. Arguably, the…

The set of 60 real rays in four dimensions derived from the vertices of a 600-cell is shown to possess numerous subsets of rays and bases that provide basis-critical parity proofs of the Bell-Kochen-Specker (BKS) theorem (a basis-critical…

We introduce and formalize a notion of "a priori knowledge" about a quantum system, and show some properties about this form of knowledge. Finally, we show that the Kochen-Specker theorem follows directly from this study. This version is a…

Following and developing ideas of R. Karasev (Covering dimension using toric varieties, arXiv:1307.3437), we extend the Lebesgue theorem (on covers of cubes) and the Knaster-Kuratowski-Mazurkiewicz theorem (on covers of simplices) to…

A central result in the foundations of quantum mechanics is the Kochen-Specker theorem. In short, it states that quantum mechanics cannot be reconciled with classical models that are noncontextual for ideal measurements. The first explicit…

A standard proof of Schur's Theorem yields that any $r$-coloring of $\{1,2,\dots,R_r-1\}$ yields a monochromatic solution to $x+y=z$, where $R_r$ is the classical $r$-color Ramsey number, the minimum $N$ such that any $r$-coloring of a…

Contextuality provides one of the fundamental characterizations of quantum phenomena, and can be used as a resource in lots of quantum information processing. In this paper, we summarize and derive some equivalent noncontextual inequalities…

For a hidden variable theory to be indistinguishable from quantum theory for finite precision measurements, it is enough that its predictions agree for some measurement within the range of precision. Meyer has recently pointed out that the…

The Kochen-Specker (KS) theorem is a cornerstone result in quantum foundations, establishing that quantum correlations in Hilbert spaces of dimension $d \geq 3$ cannot be explained by (consistent) hidden variable theories that assign a…

I examine Pan and Home's reply to my Comment on their proposal for testing noncontextual models. I show that the Kochen-Specker model for a qubit does explain all outcomes of a test based on such a proposal, so that it would be inconclusive…

The Kochen-Specker theorem shows that it is impossible to assign sharp values to all dynamical variables in quantum mechanics in such a way that the algebraic relations among the values of dynamical variables whose self-adjoint operators…

A result of Matou\v{s}ek and R\"odl in 1995 states that for every $\varepsilon>0$ and every triangle $T$ with circumradius $\rho(T)$, there exists a dimension $n=n(\varepsilon,T)$ such that every $2$-coloring of the $n$-dimensional sphere…

Quantum contextuality takes an important place amongst the concepts of quantum computing that bring an advantage over its classical counterpart. For a large class of contextuality proofs, aka. observable-based proofs of the Kochen-Specker…

A "magic rectangle" of eleven observables of four qubits, employed by Harvey and Chryssanthacopoulos (2008) to prove the Bell-Kochen-Specker theorem in a 16-dimensional Hilbert space, is given a neat finite-geometrical reinterpretation in…

To any essentially small tensor-triangulated category $\mathcal{K}$ and Thomason subset $Y \subseteq \mathrm{Spc}(\mathcal{K})$ we associate a ringed space $(\mathrm{Spf}(\mathcal{K},Y), \mathcal{O}_{\mathrm{Spf}(\mathcal{K},Y)}),$ called…

A proper $q$-coloring of a graph is an assignment of one of $q$ colors to each vertex of the graph so that adjacent vertices are colored differently. Sample uniformly among all proper $q$-colorings of a large discrete cube in the integer…

This paper presents a path to proving the Four-Color Theorem that differs from the traditional "reducible configuration" method. By introducing concepts such as "outer boundary," "primitive set," "Property A," "knot," "valid pair group,"…

The celebrated canonical Ramsey theorem of Erd\H{o}s and Rado implies that for $2\leq k\in \mathbb{N}$, any colouring of the edges of $K_n$ with $n$ sufficiently large gives a copy of $C_{2k}$ which has one of three canonical colour…