Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
157 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Cut polytope has vertices on a line (1812.03212v1)

Published 7 Dec 2018 in cs.DM and math.CO

Abstract: The cut polytope ${\rm CUT}(n)$ is the convex hull of the cut vectors in a complete graph with vertex set ${1,\ldots,n}$. It is well known in the area of combinatorial optimization and recently has also been studied in a direct relation with admissible correlations of symmetric Bernoulli random variables. That probabilistic interpretation is a starting point of this work in conjunction with a natural binary encoding of the CUT($n$). We show that for any $n$, with appropriate scaling, all vertices of the polytope ${\mathbf 1}$-CUT($n$) encoded as integers are approximately on the line $y= x-1/2$.

Summary

We haven't generated a summary for this paper yet.