惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

aimingoo的专栏
aimingoo的专栏
Jina AI
Jina AI
WordPress大学
WordPress大学
Recent Announcements
Recent Announcements
G
Google Developers Blog
I
InfoQ
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Google DeepMind News
Google DeepMind News
P
Proofpoint News Feed
MyScale Blog
MyScale Blog
M
MIT News - Artificial intelligence
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
C
Check Point Blog
J
Java Code Geeks
T
Tailwind CSS Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Microsoft Security Blog
Microsoft Security Blog
MongoDB | Blog
MongoDB | Blog
V
Visual Studio Blog
人人都是产品经理
人人都是产品经理
量子位
A
About on SuperTechFans
D
DataBreaches.Net
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Exclusivity principle, Ramsey theory, and $n$-cycle PR boxes
Raman Choudhary, Rui Soares Barbosa · 2024-11-15 · via math.CO updates on arXiv.org

The exclusivity principle (E-principle) states that the sum of probabilities of pairwise exclusive events cannot exceed 1. Unlike other principles proposed to characterize quantum correlations, its intrinsically non-bipartite formulation enables its application in more general contextuality scenarios. Although equivalent to the no-signalling condition for any bipartite Bell scenario, this equivalence breaks down for two independent copies of the same scenario. Such violation of the E-principle due to multiple copies, known as its activation effect, was studied in [Nat Commun 4, 2263 (2013)] for the nonlocal extremal boxes of $(2,m,2)$, $(2,2,d)$, and $(3,2,2)$ Bell scenarios. The authors mapped the problem of exhibiting activation effects to finding certain cliques inside joint exclusivity graphs. In this work, we refine the joint exclusivity structure to be an edge-colored exclusivity multigraph. This allows us to draw a novel connection to Ramsey theory, which guarantees the existence of certain monochromatic subgraphs in sufficiently large edge-colored cliques, providing a powerful tool for ruling out E-principle violations. We then exploit this connection, drawing on Ramsey-theoretic results to study violations of the E-principle by multiple copies of the contextual extremal boxes of $n$-cycle scenarios, called $n$-cycle PR boxes. For the usual ($n=4$) PR box we show that the known E-principle violation of $5/4$ is the maximal achievable using two copies, and that this same upper bound applies to two copies of the KCBS ($n = 5$) PR box. We then prove that $n \geq 6$-cycle PR boxes, unlike the extremal boxes of the aforementioned Bell scenarios, do not exhibit activation effects with two or three copies. Finally, for any number of independent copies $k$, we establish a lower bound on $n$ above which $n$-cycle PR boxes do not exhibit activation effects with $k$ copies.