On Mermin-type proofs of the Kochen-Specker theorem - Vijay Kumar Singh

We discuss two approaches to producing Mermin-type proofs of the Kochen-Specker theorem. In the first approach, one starts with a fixed set of constraints and methods of linear algebra are used to produce subsets that are Mermin-type proofs. Coding theory methods are used to gain further insight into the number of solutions (the total number and enumeration by weight). In the second approach, one starts with the combinatorial structure of the set of constraints and one looks for ways to suitably populate this structure with observables. As well, we are able to show that many combinatorial structures can not produce Mermin-type proofs. This is joint work with Petr Lisonek (SFU) and Robert Raussendorf (UBC)