2018
DOI: 10.1016/j.endm.2018.11.010
|View full text |Cite
|
Sign up to set email alerts
|

Cut polytope has vertices on a line

Abstract: The cut polytope CUT(n) is the convex hull of the cut vectors in a complete graph with vertex set {1, . . . , 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 encoded vertices of the polytope 1… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
references
References 6 publications
0
0
0
Order By: Relevance