DeepAI AI Chat
Log In Sign Up

Cut polytope has vertices on a line

by   Nevena Maric, et al.

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 vertices of the polytope 1-CUT(n) encoded as integers are approximately on the line y= x-1/2.


page 1

page 2

page 3

page 4


Cut Locus Realizations on Convex Polyhedra

We prove that every positively-weighted tree T can be realized as the cu...

Cut Polytopes of Minor-free Graphs

The cut polytope of a graph G is the convex hull of the indicator vector...

Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries

The problem of sparsifying a graph or a hypergraph while approximately p...

A General approach to Ammann bars for aperiodic tilings

Ammann bars are formed by segments (decorations) on the tiles of a tilin...

Graph-Cut RANSAC

A novel method for robust estimation, called Graph-Cut RANSAC, GC-RANSAC...

An extended MMP algorithm: wavefront and cut-locus on a convex polyhedron

In the present paper, we propose a novel generalization of the celebrate...

Sparsification of Binary CSPs

A cut ε-sparsifier of a weighted graph G is a re-weighted subgraph of G ...