# Cut polytope has vertices on a line

## TL;DR

This paper demonstrates that, after appropriate scaling, all vertices of the cut polytope can be approximately aligned along a single line, revealing a new geometric property of the polytope.

## Contribution

It establishes that vertices of the scaled cut polytope are approximately collinear, connecting combinatorial optimization with probabilistic interpretations.

## Key findings

- Vertices of scaled cut polytope lie near a straight line
- The result links geometric and probabilistic perspectives
- Vertices are approximately on the line y = x - 1/2

## 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$.