Related papers: Using Graph Theory to Derive Inequalities for the …
The relations between Bell's inequality and quantum probability trees are explained against the background offered by the concept of a quantum probability tree built in others works. It is shown that f we use a concept of probability tree…
The chromatic polynomial $\pi_{G}(k)$ of a graph $G$ can be viewed as counting the number of vertices in a family of coloring graphs $\mathcal C_k(G)$ associated with (proper) $k$-colorings of $G$ as a function of the number of colors $k$.…
Graph theory provides fundamental concepts for many fields of science like statistical physics, network analysis and theoretical computer science. Here we give a pedagogical introduction to graph theory, divided into three sections. In the…
In the literature, the notion of discrepancy is used in several contexts, even in the theory of graphs. Here, for a graph $G$, $\{-1, 1\}$ labels are assigned to the edges, and we consider a family $\mathcal{S}_G$ of (spanning) subgraphs of…
Let $b^{k}_{\ell,m}(n)$ denotes the number of $k-$colored partitions of $n$ into parts that are not multiples of $\ell$ or $m$. We establish several congruence relations for $b_{\ell,m}(n)$. For instance, for any nonnegative integer $n$…
A Bell inequality is a constraint on a set of correlations whose violation can be used to certify non-locality. They are instrumental for device-independent tasks such as key distribution or randomness expansion. In this work we consider…
Bell's theorem is typically understood as the proof that quantum theory is incompatible with local-hidden-variable models. More generally, we can see the violation of a Bell inequality as witnessing the impossibility of explaining quantum…
The parametric geometry of numbers has allowed to visualize the simultaneous approximation properties of a collection of real numbers through the combined graph of the related successive minima functions. Several inequalities among…
In a labeling scheme the vertices of a given graph from a particular class are assigned short labels such that adjacency can be algorithmically determined from these labels. A representation of a graph from that class is given by the set of…
A proper labeling of a graph is an assignment of integers to some elements of a graph, which may be the vertices, the edges, or both of them, such that we obtain a proper vertex coloring via the labeling subject to some conditions. The…
Vertex coloring and multicoloring of graphs are a well known subject in graph theory, as well as their applications. In vertex multicoloring, each vertex is assigned some subset of a given set of colors. Here we propose a new kind of vertex…
Correlations in Bell and noncontextuality inequalities can be expressed as a positive linear combination of probabilities of events. Exclusive events can be represented as adjacent vertices of a graph, so correlations can be associated to a…
By a finite type-graph we mean a graph whose set of vertices is the set of all $k$-subsets of $[n]=\{1,2,\ldots, n\}$ for some integers $n\ge k\ge 1$, and in which two such sets are adjacent if and only if they realise a certain order type…
Let $G$ be a simple undirected graph. The regular number of $G$ is defined to be the minimum number of subsets into which the edge set of $G$ can be partitioned so that the subgraph induced by each subset is regular. In this work, we obtain…
We analyze and compare the mathematical formulations of the criterion for separability for bipartite density matrices and the Bell inequalities. We show that a violation of a Bell inequality can formally be expressed as a witness for…
We associate all small subgraph counting problems with a systematic graph encoding/representation system which makes a coherent use of graphlet structures. The system can serve as a unified foundation for studying and connecting many…
Bell inequalities reveal the fundamentally nonlocal character of quantum mechanics. In this regard, one of the interesting problems is to explore all possible Bell inequalities that demonstrate a gap between local and nonlocal quantum…
States that strongly violate Bell's inequalities are required in many quantum informational protocols as, for example, in cryptography, secret sharing and the reduction of communication complexity. We investigate families of such states…
A graph labeling assigns values to the components of a graph (vertices, edges, etc.). In particular, distance magic labelings have been widely studied in undirected graphs. In such a labeling, the vertices are labeled with unique values…
It is shown that Bell's counterfactuals admit joint quasiprobability distributions (i.e. joint distributions exist, but may not be non-negative). A necessary and sufficient condition for the existence among them of a true probability…