betaFeedback

WorksMathematics

Combinatorial Dvoretzky Theory

Abstract

Let P⊂RnP \subset \mathbb{R}^n be an nn-dimensional polytope such that P⊂B2nP \subset B_2^n. Let M∗(P)M^*(P) denote its mean width, and let NN be the number of facets (faces of dimension n−1n-1) of PP. We prove the following two bounds: (1) If N≤enN \leq e^n, then M∗(P)≤1−clog⁡2(Nn). M^*(P) \leq 1 - \frac{c}{\log^2(\frac{N}{n})}. (2) For arbitrary NN, M∗(P)≤1−cnN−2n−1. M^*(P) \leq 1 - \frac{c}{n}N^{-\frac{2}{n-1}}. In both bounds, c>0c>0 is an absolute constant.

Paper details

vlnc:W_y93ebwnp
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…