New classes of facets of the cut polytope and tightness of \(I_{mm22}\) Bell inequalities

DOI10.1016/j.dam.2007.03.005zbMath1188.52007arXivmath/0505143OpenAlexW2083923137MaRDI QIDQ2381532

Tsuyoshi Ito, David Avis

Publication date: 18 September 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0505143

zbMATH Keywords

cut polytopecorrelation polytope\(I_{mm22}\) Bell inequalityGrishukhin inequality

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Graph theory (05C99)

Related Items (3)

The bipartite Boolean quadric polytope ⋮ The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints ⋮ Lifting and separation procedures for the cut polytope

Cites Work

• Unnamed Item
• Correlation polytopes: Their geometry and complexity
• Quantum probability - quantum logic
• All the facets of the six-point Hamming cone
• Collapsing and lifting for the cut cone
• All facets of the cut cone \(C_ n\) for \(n=7\) are known
• Application of cut polyhedra. I
• Applications of cut polyhedra. II
• The cut cone,L1 embeddability, complexity, and multicommodity flows
• A relevant two qubit Bell inequality inequivalent to the CHSH inequality
• Proposed Experiment to Test Local Hidden-Variable Theories
• Two-party Bell inequalities derived from combinatorics via triangular elimination
• Geometry of cuts and metrics

This page was built for publication: New classes of facets of the cut polytope and tightness of \(I_{mm22}\) Bell inequalities