English
Related papers

Related papers: Coloring the rational quantum sphere and the Koche…

200 papers

We collect some of our favorite proofs of Brooks' Theorem, highlighting advantages and extensions of each. The proofs illustrate some of the major techniques in graph coloring, such as greedy coloring, Kempe chains, hitting sets, and the…

Combinatorics · Mathematics 2017-05-15 Daniel W. Cranston , Landon Rabern

We give a full, correct proof of the following result, earlier claimed by Erd\H{o}s and Komj\'ath. If the Continuum Hypothesis holds then there is a coloring of the plane with countably many colors, with no monocolored right triangle.

Logic · Mathematics 2023-02-24 Balázs Bursics , Péter Komjáth

In a previous paper, we have proposed assigning as the value of a physical quantity in quantum theory, a certain kind of set (a sieve) of quantities that are functions of the given quantity. The motivation was in part physical---such a…

Quantum Physics · Physics 2007-05-23 C. J. Isham , J. Butterfield

In Euclidean Ramsey Theory usually we are looking for monochromatic configurations in the Euclidean space, whose points are colored with a fixed number of colors. In the canonical version, the number of colors is arbitrary, and we are…

Combinatorics · Mathematics 2026-02-03 Panna Gehér , Arsenii Sagdeev , Géza Tóth

A simple three rules supplemented by five steps scheme is proposed to produce Kochen-Specker (KS) sets with 30 rank-2 projectors that occur twice each. The KS sets provide state-independent proof of KS theorem based on a system of three…

Quantum Physics · Physics 2013-04-30 S. P. Toh

The quantum chromatic number of a graph $G$ is sandwiched between its chromatic number and its clique number, which are well known NP-hard quantities. We restrict our attention to the rank-1 quantum chromatic number $\chi_q^{(1)}(G)$, which…

Quantum Physics · Physics 2012-02-22 Giannicola Scarpa , Simone Severini

It is shown that the 33 complex rays in three dimensions used by Penrose to prove the Bell-Kochen-Specker theorem have the same orthogonality relations as the 33 real rays of Peres, and therefore provide an isomorphic proof of the theorem.…

Quantum Physics · Physics 2015-05-14 Elizabeth Gould , P. K. Aravind

In this work methods of construction of cubic graphs are analyzed and a theorem of existence of a colored disc traversing each pair of linked edges belonging to an elementary cycle of a planar cubic graph is proved.

Combinatorics · Mathematics 2010-06-04 Sergey Kurapov

We present a method to assign, for any radius $r$ greater than about 12.44, one of seven colors to each point in $\mathbb{R}^3$ lying at distance $r$ from the origin, such that no two points at unit distance from each other are assigned the…

Combinatorics · Mathematics 2021-07-27 Tomas Sirgedas

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

We investigate multiple qubit Pauli groups and the quantum states/rays arising from their maximal bases. Remarkably, the real rays are carried by a Barnes-Wall lattice $BW_n$ ($n=2^m$). We focus on the smallest subsets of rays allowing a…

Quantum Physics · Physics 2012-09-27 Michel R. P. Planat

We construct a quantum extension of the (classical) three-coloring model introduced by Baxter [J.Math.Phys.11, 784 (1970)] for which the ground state can be computed exactly along a continuous line of Rokhsar-Kivelson solvable points. The…

Strongly Correlated Electrons · Physics 2007-11-30 Claudio Castelnovo , Claudio Chamon , Christopher Mudry , Pierre Pujol , .

In the topos approach to quantum theory of Doering and Isham the Kochen-Specker Theorem, which asserts the contextual nature of quantum theory, can be reformulated in terms of the global sections of a presheaf characterised by the Gelfand…

Logic in Computer Science · Computer Science 2018-03-05 Kevin Dunne

In this paper we attempt to physically interpret the Modal Kochen- Specker (MKS) theorem. In order to do so, we analyze the features of the possible properties of quantum systems arising from the elements in an orthomodular lattice and…

Quantum Physics · Physics 2014-04-24 Christian de Ronde , Hector Freytes , Graciela Domenech

This paper is a contribution to the algebraic study of contextuality in quantum theory. As an algebraic analogue of Kochen and Specker's no-hidden-variables result, we investigate rational subrings over which the partial ring of $d \times…

Number Theory · Mathematics 2025-11-21 Ida Cortez , Camilo Morales , Manuel Reyes

Several arguments demonstrate the incompatibility between Quantum Mechanics and classical Physics. Bell's inequalities and Greenberger-Horne-Zeilinger (GHZ) arguments apply to specific non-classical states. The Kochen-Specker (KS) one,…

Quantum Physics · Physics 2024-11-28 Alejandro Hnilo

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

We consider the question of when a rational homology 3-sphere is rational homology cobordant to a connected sum of lens spaces. We prove that every rational homology cobordism class in the subgroup generated by lens spaces is represented by…

Geometric Topology · Mathematics 2020-11-04 Paolo Aceto , Daniele Celoria , JungHwan Park

W. T. Gower generalized Hindman's Finite sum theorem over $X_{k}=\left\{ \left(n_{1},n_{2},\ldots,n_{k}\right):n_{1}\neq0\right\} $ by showing that for any finite coloring of $X_{k}$ there exists a sequence such that the Gower subspace…

Combinatorics · Mathematics 2022-10-31 Sayan Goswami

A recent lower bound on the number of edges in a k-critical n-vertex graph by Kostochka and Yancey yields a half-page proof of the celebrated Gr\"otzsch Theorem that every planar triangle-free graph is 3-colorable. In this paper we use the…

Combinatorics · Mathematics 2016-12-16 Oleg V. Borodin , Alexandr V. Kostochka , Bernard Lidický , Matthew Yancey
‹ Prev 1 3 4 5 6 7 10 Next ›