Related papers: New Kochen-Specker Sets in Four Dimensions
We introduce a new class of algorithms for finding a short vector in lattices defined by codes of co-dimension $k$ over $\mathbb{Z}_P^d$, where $P$ is prime. The co-dimension $1$ case is solved by exploiting the packing properties of the…
Kochen-Specker theorems assure the breakdown of certain types of non-contextual hidden variable theories through the non-existence of global, holistic frame functions; alas they do not allow us to identify where this breakdown occurs, nor…
Kent's conclusion that ``non-contextual hidden variable theories cannot be excluded by theoretical arguments of the Kochen-Specker type once the imprecision in real world experiments is taken into account'' [Phys. Rev. Lett. 83, 3755…
GHZ paradoxes are presented for all even numbers of qubits from four up. They are obtained from proofs of the Kochen-Specker (KS) theorem by showing how the assumption of noncontextuality can be justified on the basis of locality. The…
The Kochen-Specker theorem is one of the fundamental no-go theorems in quantum theory. It has far-reaching consequences for all attempts trying to give an interpretation of the quantum formalism. In this work, we examine the hypotheses…
Quantum contextuality, as proved by Kochen and Specker, and also by Bell, should manifest itself in any state in any system with more than two distinguishable states and recently has been experimentally verified on various physical systems.…
G. Moreno's abstract depiction of the Sedenions' normed zero-divisors, as homomorphic to the exceptional Lie group G2, is fleshed out by exploring further structures the A-D-E approach of Lie algebraic taxonomy keeps hidden. A breakdown of…
The NP-complete problem Feedback Vertex Set is that of deciding whether or not it is possible, for a given integer $k\geq 0$, to delete at most $k$ vertices from a given graph so that what remains is a forest. The variant in which the…
The Kochen-Specker theorem is a fundamental result in quantum foundations that has spawned massive interest since its inception. We show that within every Kochen-Specker graph, there exist interesting subgraphs which we term $01$-gadgets,…
The existence of large sets of Kirkman triple systems (LKTSs) is one of the best-known open problems in combinatorial design theory. Steiner quadruple systems with resolvable derived designs (RDSQSs) play an important role in the recursive…
We present CS-FLEURS, a new dataset for developing and evaluating code-switched speech recognition and translation systems beyond high-resourced languages. CS-FLEURS consists of 4 test sets which cover in total 113 unique code-switched…
Given a graph $G$ and a parameter $k$, the Chordal Vertex Deletion (CVD) problem asks whether there exists a subset $U\subseteq V(G)$ of size at most $k$ that hits all induced cycles of size at least 4. The existence of a polynomial kernel…
We describe an algorithm to enumerate polytopes. This algorithm is then implemented to give a complete classification of combinatorial spheres of dimension 3 with 9 vertices and decide polytopality of those spheres. In particular, we…
A comparison was made of vectors derived by using ordinary co-occurrence statistics from large text corpora and of vectors derived by measuring the inter-word distances in dictionary definitions. The precision of word sense disambiguation…
Distributed word representations, or word vectors, have recently been applied to many tasks in natural language processing, leading to state-of-the-art performance. A key ingredient to the successful application of these representations is…
Let $\mathcal{K}_n$ be the so-called wild Kronecker quiver, i.e., a quiver with one source and one sink and $n\geq 3$ arrows from the source to the sink. The following problems will be studied for an arbitrary regular component…
In this note, we construct explicit SOS decomposition of A Fourth Order Four Dimensional Hankel Tensor with A Symmetric Generating Vector, at the critical value. This is a supplementary note to Paper [3].
A new theory-independent noncontextuality inequality is presented [Phys. Rev. Lett. 115, 110403 (2015)] based on Kochen-Specker (KS) set without imposing the assumption of determinism. By proposing novel noncontextuality inequalities, we…
Via computer search, we found seven non-isomorphic $1$-rotational Steiner systems $S(2,6,226)$ and six point-transitive Steiner systems $S(2,6,441)$, resolving two of $29$ previously undecided cases for $S(2,6,v)$.
It is known that the problem of deleting at most k vertices to obtain a proper interval graph (Proper Interval Vertex Deletion) is fixed parameter tractable. However, whether the problem admits a polynomial kernel or not was open. Here, we…