English
Related papers

Related papers: Kochen-Specker sets in four-dimensional spaces

200 papers

In this paper we introduce the galaxy of Coxeter groups -- an infinite dimensional, locally finite, ranked simplicial complex which captures isomorphisms between Coxeter systems. In doing so, we would like to suggest a new framework to…

Group Theory · Mathematics 2025-06-10 Yuri Santos Rego , Petra Schwer

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…

Quantum Physics · Physics 2015-06-11 Mordecai Waegell , P. K. Aravind

While faces of a polytope form a well structured lattice, in which faces of each possible dimension are present, this is not true for general compact convex sets. We address the question of what dimensional patterns are possible for the…

Metric Geometry · Mathematics 2017-03-23 Vera Roshchina , Tian Sang , David Yost

We investigate group coding for arbitrary finite groups acting linearly on a vector space. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using…

Combinatorics · Mathematics 2013-11-28 Hye Jung Kim , J. B. Nation , Anne V. Shepler

This article delves into the concept of quantum contextuality, specifically focusing on proofs of the Kochen-Specker theorem obtained by assigning Pauli observables to hypergraph vertices satisfying a given commutation relation. The…

Quantum Physics · Physics 2025-08-27 Axel Muller , Alain Giorgetti

The Kochen-Specker theorem states that noncontextual hidden variable theories are incompatible with quantum mechanics. We provide a state independent proof of the Kochen-Specker theorem using the smallest number of projectors, i.e., thirty…

Quantum Physics · Physics 2015-06-17 S. P. Toh

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…

Quantum Physics · Physics 2015-05-20 Mordecai Waegell , P. K. Aravind , Norman D. Megill , Mladen Pavicic

Convex sets arising in a variety of applications are well-defined for every relevant dimension. Examples include the simplex and the spectraplex that correspond to probability distributions and to quantum states; combinatorial polytopes and…

Optimization and Control · Mathematics 2025-10-24 Eitan Levin , Venkat Chandrasekaran

We give some new explicit examples of putatively optimal projective spherical designs. i.e., ones for which there is numerical evidence that they are of minimal size. These form continuous families, and so have little apparent symmetry in…

Combinatorics · Mathematics 2025-03-20 Alex Elzenaar , Shayne Waldron

Given any finite set of nonnegative integers, there exists a closed convex set whose facial dimension signature coincides with this set of integers, that is, the dimensions of its nonempty faces comprise exactly this set of integers. In…

Optimization and Control · Mathematics 2024-08-26 Vera Roshchina , Levent Tunçel

We construct an infinite family of 4-polytopes whose realization spaces have dimension smaller or equal to 96. This in particular settles a problem going back to Legendre and Steinitz: whether and how the dimension of the realization space…

Combinatorics · Mathematics 2014-03-20 Karim A. Adiprasito , Günter M. Ziegler

Steiner systems are a fascinating topic of combinatorics. The most studied Steiner systems are $S(2, 3, v)$ (Steiner triple systems), $S(3, 4, v)$ (Steiner quadruple systems), and $S(2, 4, v)$. There are a few infinite families of Steiner…

Information Theory · Computer Science 2017-06-02 Cunsheng Ding

We give a lower bound for the size of a subset of $\mathbb F_q^n$ containing a rich k-plane in every direction, a k-plane Furstenberg set. The chief novelty of our method is that we use arguments on non-reduced subschemes and flat families…

Algebraic Geometry · Mathematics 2016-10-05 Jordan S. Ellenberg , Daniel Erman

The notion of a k-automatic set of integers is well-studied. We develop a new notion - the k-automatic set of rational numbers - and prove basic properties of these sets, including closure properties and decidability.

Formal Languages and Automata Theory · Computer Science 2015-09-02 Eric Rowland , Jeffrey Shallit

In connection with the work of Anscombe, Macpherson, Steinhorn and the present author in [1] we investigate the notion of a multidimensional exact class ($R$-mec), a special kind of multidimensional asymptotic class ($R$-mac) with measuring…

Logic · Mathematics 2021-07-01 Daniel Wolf

It has recently been questioned whether the Kochen-Specker theorem is relevant to real experiments, which by necessity only have finite precision. We give an affirmative answer to this question by showing how to derive hidden-variable…

Quantum Physics · Physics 2009-11-06 Christoph Simon , Caslav Brukner , Anton Zeilinger

After results by the author (1980, 1981), and by Vinberg (1981), finiteness of the number of maximal arithmetic reflection groups in Lobachevsky spaces was not known in dimensions $2\le n\le 9$ only. Recently (2005), the finiteness was…

Algebraic Geometry · Mathematics 2015-06-26 Viacheslav V. Nikulin

We study a relation between brick $n$-tuples of subspaces of a finite dimensional linear space, and irreducible $n$-tuples of subspaces of a finite dimensional Hilbert (unitary) space such that a linear combination, with positive…

Functional Analysis · Mathematics 2008-07-15 Yu. S. Samoilenko , D. Y. Yakymenko

There exist natural generalizations of the real moduli space of Riemann spheres based on manipulations of Coxeter complexes. These novel spaces inherit a tiling by the graph-associahedra convex polytopes. We obtain explicit configuration…

Geometric Topology · Mathematics 2009-08-27 Suzanne M. Armstrong , Michael Carr , Satyan L. Devadoss , Eric Engler , Ananda Leininger , Michael Manapat

We study the family of rational sets of words, called completely reducible and which are such that the syntactic representation of their characteristic series is completely reducible. This family contains, by a result of Reutenauer, the…

Formal Languages and Automata Theory · Computer Science 2016-11-22 Dominique Perrin