Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2604.16735

On the volumes of the elliptope, metric polytope, and cut polytope

David Avis·Luc Devroye·Antoine Deza
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we investigate the relationships between the volumes of four convex bodies: the cut polytope, metric polytope, rooted metric polytope, and elliptope, defined on graphs with n vertices. After an affine change of coordinates for the elliptope, the cut polytope is contained in each of the other three, which, for optimization purposes, provide polynomial-time relaxations. It is therefore of interest to see how tight these relaxations are. Worst-case ratio bounds are well known, but these are limited to objective functions with non-negative coefficients. Volume ratios, pioneered by Jon Lee with several co-authors, give global bounds and are the subject of this paper. For the rooted metric polytope over the complete graph, we show that for large n its volume is much greater than that of the elliptope. For the metric polytope, for small values of n, we show that its volume is smaller than that of the elliptope; however, for large values, we prove that the converse is true. Volume estimates place the crossover near n = 13. We also give exact formulae for the volumes of several families of sparse cut polytopes. In particular, we give an exact formula for the volume of the elliptope of every cycle and show that its volume ratio with the corresponding cut polytope converges rapidly to one.

Explore related subjects

cs.DMcs.CG

Keep this discovery

BibTeXRIS

David Avis, Luc Devroye, Antoine Deza. 2026-09-02. On the volumes of the elliptope, metric polytope, and cut polytope. https://arxiv.org/abs/2604.16735

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.CG subjectcs.DM subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

Column Number of Delta-modular matrices: Refined Analysis via Sauer Matrices

In this paper, we build upon the analysis initiated by Gennadiy Averkov and Matthias Schymura (2022) and establish that the number of distinct columns of a $Δ$-modular matrix $A \in \mathbb{Z}^{m \times n}$ of rank $m$ is $O(m^3 Δ)$. This upper bound was previously known only for odd values of $Δ$. Recall that a matrix is called $Δ$-modular if the maximum of the absolute values of its $m \times m$ minors equals $Δ$.

math.CO↗
arXiv2026

Curves, points, incidences and covering

Given a point set, mostly a grid in our case, we seek upper and lower bounds on the number of curves that are needed to cover the point set. We say a curve covers a point if the curve passes through the point. We consider such coverings by monotonic curves, lines, orthoconvex curves, circles, etc. We also study a problem that is converse of the covering problem -- if a set of $n^2$ points in the plane is covered by $n$ lines then can we say something about the configuration of the points?

math.CO↗
arXiv2026

Helly-Type Theorems for Splitting Point Sets

Let $0 < α\leq 1/2$. We say that a finite point set $P$ in $\mathbb{R}^d$ is $α$-split by a hyperplane $h$ if each of the closed half-spaces determined by $h$, contains at least $α|P|$ of the points of $P$. We further say $P$ is $α$-split by a $k$-dimensional flat $τ$ if $P$ is $α$-split by any hyperplane through $τ$. In the standard notation (which coincides with Tukey depth for $k= 0$), the $k$-flat $τ$ has depth $α$ with respect to $P$. We establish interesting Helly-type theorems for splitting families of finite point sets in $\mathbb{R}^d$. Unlike the classical sufficient Helly-type criteria for transversals to families of compact convex sets, which exist only for point and hyperplanes, our results extend to splitting families of point sets by collections of $k$-flats of arbitrary dimensionality $ 0 \leq k \leq d-1$.

math.CO↗