Related papers: Using Graph Theory to Derive Inequalities for the …
The algebraic derivation of the numerical limits of Bell inequalities in either three or four random variables is independent of the assumption of randomness.The limits of the inequalities follow as mathematical consequences of their…
An equitable coloring of a graph $G=(V,E)$ is a (proper) vertex-coloring of $G$, such that the sizes of any two color classes differ by at most one. In this paper, we consider the equitable coloring problem in block graphs. Recall that the…
We discuss general Bell inequalities for bipartite and multipartite systems, emphasizing the connection with convex geometry on the mathematical side, and the communication aspects on the physical side. Known results on families of…
Instrumental variables allow the estimation of cause and effect relations even in presence of unobserved latent factors, thus providing a powerful tool for any science wherein causal inference plays an important role. More recently, the…
For a graph $G$ and a positive integer $k$, the $k$-Bell colour graph of $G$ is the graph whose vertices are the partitions of $V$ into at most $k$ independent sets, with two of these being adjacent if there exists a vertex $x$ such that…
The asymmetric coloring number of a graph is the minimum number of colors needed to color its vertices, so that no non-trivial automorphism preserves the color classes. We investigate the asymmetric coloring number of graphs that are…
A graph $G$ is defined encapsulating the number theoretic notion of the Fundamental Theorem of Arithmetic. We then provide a graph theoretic approach to the fundamental results on the coprimality of two natural numbers, through the use of…
Multipartite Bell-type inequalities are derived for general systems. They involve up to eight observables with arbitrary spectra on each site. These inequalities are closely related to the algebras of quaternions and octonions.
Non-contextuality (NC) and Bell inequalities can be expressed as bounds $\Omega$ for positive linear combinations $S$ of probabilities of events, $S \leq \Omega$. Exclusive events in $S$ can be represented as adjacent vertices of a graph…
A proper vertex colouring of a graph is \emph{nested} if the vertices of each of its colour classes can be ordered by inclusion of their open neighbourhoods. Through a relation to partially ordered sets, we show that the nested chromatic…
We introduce Bell inequalities based on covariance, one of the most common measures of correlation. Explicit examples are discussed, and violations in quantum theory are demonstrated. A crucial feature of these covariance Bell inequalities…
Exponentiating the hypergeometric series gives a recursion relation for integer sequences which are generalizations of conventional Bell numbers. The corresponding associated Stirling numbers of the second kind are also generated and…
In this work we present the notion of greyscale of a graph as a colouring of its vertices that uses colours from the real interval [0,1]. Any greyscale induces another colouring by assigning to each edge the non-negative difference between…
Bell inequalities play a central role in the study of quantum non-locality and entanglement, with many applications in quantum information. Despite the huge literature on Bell inequalities, it is not easy to find a clear conceptual answer…
A well-studied concept is that of the total chromatic number. A proper total colouring of a graph is a colouring of both vertices and edges so that every pair of adjacent vertices receive different colours, every pair of adjacent edges…
We study the enumeration of set partitions, according to their length, number of parts, cyclic type, and genus. We introduce genus-dependent Bell, Stirling numbers, and Fa\`a di Bruno coefficients. Besides attempting to summarize what is…
We derive closed formulas for the number of $k$-coloured partitions and the number of plane partitions of $n$ in terms of the Bell polynomials.
The number partitioning problem consists of partitioning a sequence of positive numbers ${a_1,a_2,..., a_N}$ into two disjoint sets, ${\cal A}$ and ${\cal B}$, such that the absolute value of the difference of the sums of $a_j$ over the two…
A proper coloring of vertices of a graph is equitable if the sizes of any two color classes differ by at most 1. Such colorings have many applications and are interesting by themselves. In this paper, we discuss the state of art and…
The ring of graph invariants is spanned by the basic graph invariants which calculate the number of subgraphs isomorphic to a given graph in other graphs. These subgraphs counting invariants are not algebraically independent. In our view…