Related papers: Exclusivity principle, Ramsey theory, and $n$-cycl…
The celebrated canonical Ramsey theorem of Erd\H{o}s and Rado implies that for a given $k$-uniform hypergraph (or $k$-graph) $H$, if $n$ is sufficiently large then any colouring of the edges of the complete $k$-graph $K^{(k)}_n$ gives rise…
A necessary condition for the probabilities of a set of events to exhibit Bell nonlocality or Kochen-Specker contextuality is that the graph of exclusivity of the events contains induced odd cycles with five or more vertices, called odd…
This work examines the problem of clique enumeration on a graph by exploiting its clique covers. The principle of inclusion/exclusion is applied to determine the number of cliques of size $r$ in the graph union of a set $\mathcal{C} =…
Entangled quantum systems can exhibit correlations that cannot be simulated classically. For historical reasons such correlations are called "Bell inequality violations." We give two new two-player games with Bell inequality violations that…
A paramount topic in quantum foundations, rooted in the study of the EPR paradox and Bell inequalities, is that of characterizing quantum theory in terms of the space-like correlations it allows. Here we show that to focus only on…
The Ramsey multiplicity constant of a graph $H$ is the minimum proportion of copies of $H$ in the complete graph which are monochromatic under an edge-coloring of $K_n$ as $n$ goes to infinity. Graphs for which this minimum is…
We consider a random geometric graph $G(\chi_n, r_n)$, given by connecting two vertices of a Poisson point process $\chi_n$ of intensity $n$ on the unit torus whenever their distance is smaller than the parameter $r_n$. The model is…
Contextuality is one way of capturing the non-classicality of quantum theory. The contextual nature of a theory is often witnessed via the violation of non-contextuality inequalities---certain linear inequalities involving probabilities of…
One formulation of the Erdos-Szekeres monotone subsequence theorem states that for any red/blue coloring of the edge set of the complete graph on $\{1, 2, \ldots, N\}$, there exists a monochromatic red $s$-clique or a monochromatic blue…
It is known that Paley graphs of square order have the strict-EKR property, that is, all maximum cliques are canonical cliques. Peisert-type graphs are natural generalizations of Paley graphs and some of them also have the strict-EKR…
Quantum theory is consistent with a computational model permitting black-box operations to be applied in an indefinite causal order, going beyond the standard circuit model of computation. The quantum switch -- the simplest such example --…
This paper concentrates on a particular example of a constraint imposed by superselection rules (SSRs): that which applies when the parties (Alice and Bob) cannot distinguish among certain quantum objects they have. This arises naturally in…
We show that the classical capacity of quantum states, as quantified by its ability to perform dense coding, respects an exclusion principle, for arbitrary pure or mixed three-party states in any dimension. This states that no two bipartite…
We describe an experiment in which two non communicating computers, starting from a common input in the form of sequences of pseudo--random numbers in the interval $[0,2\pi]$, and computing deterministic $\{\pm 1\}$--valued functions,…
A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for \textsc{Maximum Clique} on unit disk graphs [Clark, Colbourn, Johnson; Discrete…
The assumption of local realism in a Bell locality scenario imposes non-trivial conditions on the Shannon entropies of the associated probability distributions, expressed by linear entropic Bell inequalities. In principle, these entropic…
This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. These can be seen as generalizations of the birthday problem (what is the chance that there are two friends with…
The cross-entropy method (CE) developed by R. Rubinstein is an elegant practical principle for simulating rare events. The method approximates the probability of the rare event by means of a family of probabilistic models. The method has…
A strong interaction is known to exist between edge-colored graphs (which encode PL pseudo-manifolds of arbitrary dimension) and random tensor models (as a possible approach to the study of Quantum Gravity). The key tool is the {\it…
For a random graph subject to a topological constraint, the microcanonical ensemble requires the constraint to be met by every realisation of the graph (`hard constraint'), while the canonical ensemble requires the constraint to be met only…