Related papers: Using Graph Theory to Derive Inequalities for the …
The Bell colouring graph $\mathcal{B}(G)$ of a graph $G$ is the graph whose vertices are the partitions of the vertex set of $G$ into independent sets, with an edge between two partitions if and only if one can be obtained from the other by…
For a given number of colors, $s$, the guessing number of a graph is the (base $s$) logarithm of the cardinality of the largest family of colorings of the vertex set of the graph such that the color of each vertex can be determined from the…
We study the average number $\mathcal{A}(G)$ of colors in the non-equivalent colorings of a graph $G$. We show some general properties of this graph invariant and determine its value for some classes of graphs. We then conjecture several…
It is a recent realization that many of the concepts and tools of causal discovery in machine learning are highly relevant to problems in quantum information, in particular quantum nonlocality. The crucial ingredient in the connection…
Bell inequalities constitute a key tool in quantum information theory: they not only allow one to reveal nonlocality in composite quantum systems, but, more importantly, they can be used to certify relevant properties thereof. We provide a…
Given a graph $G$, the Bell $k$-coloring graph $\mathcal{B}_k(G)$ has vertices given by partitions of $V(G)$ into $k$ independent sets (allowing empty parts), with two partitions adjacent if they differ only in the placement of a single…
It is known that the ordered Bell numbers count all the ordered partitions of the set $[n]=\{1,2,\dots,n\}$. In this paper, we introduce the deranged Bell numbers that count the total number of deranged partitions of $[n]$. We first study…
It is shown that the Bell inequalities are closely related to the triangle inequalities involving distance functions amongst pairs of random variables with values $\left\{ 0,1\right\} $. A hidden variables model may be defined as a mapping…
We investigate the non-local properties of graph states. To this aim, we derive a family of Bell inequalities which require three measurement settings for each party and are maximally violated by graph states. In turn, for each graph state…
A coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. Two colorings are equivalent if they induce the same partition of the vertex set into color classes. Let $\mathcal{A}(G)$ be…
The Bell inequalities in three and four correlations are re-derived in general forms showing that three and four data sets, respectively, identically satisfy them regardless of whether they are random, deterministic, measured, predicted, or…
A graph is a split graph if its vertex set can be partitioned into a clique and a stable set. A split graph is unbalanced if there exist two such partitions that are distinct. Cheng, Collins and Trenk (2016), discovered the following…
For each positive integer $n$, we define the divisibility relation graph $D_n$ whose vertex set is the set of divisors of $n$, and in which two vertices are adjacent if one is a divisor of the other. This type of graph is a special case of…
Many issues combine for consideration when speaking of Bell's Inequalities: nonlocality, realism, hidden variables, incompatible measures, wave function collapse, other. Each of these issues then may be viewed from several viewpoints:…
Characterizing the set of all Bell inequalities is a notably hard task. An insightful method of solving it in case of Bell correlation inequalities for scenarios with two dichotomic measurements per site - for arbitrary number of parties -…
This paper defines, for each graph $G$, a flag vector $fG$. The flag vectors of the graphs on $n$ vertices span a space whose dimension is $p(n)$, the number of partitions on $n$. The analogy with convex polytopes indicates that the linear…
A vertex coloring of a graph $G$ is called distinguishing (or symmetry breaking) if no non-identity automorphism of $G$ preserves it, and the distinguishing number, shown by $D(G)$, is the smallest number of colors required for such a…
Set-coloring a graph means giving each vertex a subset of a fixed color set so that no two adjacent subsets have the same cardinality. When the graph is complete one gets a new distribution problem with an interesting generating function.…
The predictions of quantum mechanics cannot be resolved with a completely classical view of the world. In particular, the statistics of space-like separated measurements on entangled quantum systems violate a Bell inequality. We put forward…
Bell inequalities bound the strength of classical correlations between observers measuring on a shared physical system. However, studies of physical correlations can be considered beyond the standard Bell scenario by networks of observers…