Mediated Digraphs and Quantum Nonlocality
Preprint
Abstract
A digraph D=(V,A) is mediated if, for each pair x,y of distinct vertices of D, either xy belongs to A or yx belongs to A or there is a vertex z such that both xz,yz belong to A. For a digraph D, DELTA(D) is the maximum in-degree of a vertex in D. The "nth mediation number" mu(n) is the minimum of DELTA(D) over all mediated digraphs on n vertices. Mediated digraphs and mu(n) are of interest in the study of quantum nonlocality. We obtain a lower bound f(n) for mu(n) and determine infinite sequences of values of n for which mu(n)=f(n) and mu(n)>f(n), respectively. We derive upper bounds for mu(n) and prove that mu(n)=f(n)(1+o(1)). We conjecture that there is a constant c such that mu(n)=<f(n)+c. Methods and results of graph theory, design theory and number theory are used.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Extent of multiparticle quantum nonlocalityPhysical Review A, 2005
- Communication Cost of Simulating Bell CorrelationsPhysical Review Letters, 2003
- Doubly regular digraphs and symmetric designsJournal of Combinatorial Theory, Series A, 2003
- Bell-Type Inequalities for Partial Separability in-Particle Systems and Quantum Mechanical ViolationsPhysical Review Letters, 2002
- Bell-Type Inequalities to Detect True-Body NonseparabilityPhysical Review Letters, 2002
- The Difference Between Consecutive Primes, IIProceedings of the London Mathematical Society, 2001
- Quorums from difference coversInformation Processing Letters, 2000
- The Non-Existence of Finite Projective Planes of Order 10Canadian Journal of Mathematics, 1989
- Speakable and Unspeakable in Quantum MechanicsAmerican Journal of Physics, 1989
- The Nonexistence of Certain Finite Projective PlanesCanadian Journal of Mathematics, 1949