相关论文: Exclusivity principle, Ramsey theory, and $n$-cycl…

Contextuality is a fundamental feature of quantum theory and a necessary resource for quantum computation and communication. It is therefore important to investigate how large contextuality can be in quantum theory. Linear contextuality…

The question concerning the physical realizability of a probability distribution is of quite importance in Quantum foundations. Specker first pointed out that this question cannot be answered from Kolmogorov's axioms alone. Lately, this…

We propose a novel causal principle that is a genuinely multipartite extension of Reichenbach's common cause principle, namely, the coordination principle: parties in a network can achieve perfect randomized coordination--in particular,…

R\"odl and Ruci\'nski (1990) established Ramsey's theorem for random graphs. In particular, for fixed integers $r$, $\ell\geq 2$ they showed that $\hat p_{K_\ell,r}(n)=n^{-\frac{2}{\ell+1}}$ is a threshold for the Ramsey property that every…

A graph $G$ is said to be $q$-Ramsey for a $q$-tuple of graphs $(H_1,\ldots,H_q)$, denoted by $G\to_q(H_1,\ldots,H_q)$, if every $q$-edge-coloring of $G$ contains a monochromatic copy of $H_i$ in color $i,$ for some $i\in[q]$. Let…

The odd-Ramsey number $r_{\text{odd}}(n,H)$ of a graph $H$ is the minimum number of colors needed to edge-color $K_n$ so that in every copy of $H$ some color occurs an odd number of times, and the unique-Ramsey number $r_{\text{u}}(n,H)$ is…

The main purpose of this paper is to study extremal results on the intersection graphs of boxes in $\R^d$. We calculate exactly the maximal number of intersecting pairs in a family $\F$ of $n$ boxes in $\R^d$ with the property that no $k+1$…

The exponential family of random graphs is one of the most promising class of network models. Dependence between the random edges is defined through certain finite subgraphs, analogous to the use of potential energy to provide dependence…

Let $ H = (V,E) $ be a hypergraph. By the chromatic number of a hypergraph $ H = (V,E) $ we mean the minimum number $\chi(H)$ of colors needed to paint all the vertices in $ V $ so that any edge $ e \in E $ contains at least two vertices of…

There is as yet no theoretical framework to guide the search for emergent constraints. As a result, there are significant risks that indiscriminate data-mining of the multidimensional outputs from GCMs could lead to spurious correlations…

Several mechanical realizations of PR-Boxes are discussed. Apart from superluminal correlations, which are known not to be realizable by classical devices, the requirements (1) PR-condition on input-output relations, (2) non-signaling, and…

Let $r_k(s, e; t)$ denote the smallest $N$ such that any red/blue edge coloring of the complete $k$-uniform hypergraph on $N$ vertices contains either $e$ red edges among some $s$ vertices, or a blue clique of size $t$. Erd\H os and Hajnal…

Pure states are very important in any theory since they represent states of maximal information about the system within the theory. Here, we show that no non-trivial (not local realistic) extremal states (boxes) of general no-signaling…

We propose an analysis technique for the exceptional points (EPs) occurring in the discrete spectrum of open quantum systems (OQS), using a semi-infinite chain coupled to an endpoint impurity as a prototype. We outline our method to locate…

The Ramsey number $r(H)$ of a graph $H$ is the minimum $n$ such that any two-coloring of the edges of the complete graph $K_n$ contains a monochromatic copy of $H$. The threshold Ramsey multiplicity $m(H)$ is then the minimum number of…

We consider combinatorial avoidance and achievement games based on graph Ramsey theory: The players take turns in coloring still uncolored edges of a graph G, each player being assigned a distinct color, choosing one edge per move. In…

The quantum enhancement of success probability in the Random Access Code (RAC) protocols remains unexplored from two important perspectives. First, the use of entanglement between two co-measurable degrees of freedom of a single particle…

Extremal non-signaling (ENS) boxes are correlations that correspond to vertices of the non-signaling polytope of a Bell scenario. Neither quantum theory nor any theory for ideal measurements allows for ENS boxes. That is, according to…

The quantum theory (QT) and new stochastic approaches have no deterministic prediction for a single measurement or for a single time -series of events observed for a trapped ion, electron or any other individual physical system. The…

We prove several results about three families of graphs. For queen graphs, defined from the usual moves of a chess queen, we find the edge-chromatic number in almost all cases. In the unproved case, we have a conjecture supported by a vast…