The Mean Width of a Convex Polytope

نویسنده

  • G. C. SHEPHARD
چکیده

In the case n=d = 2, because of Cauchy's surface-area formula [2; p. 208], relation (3) reduces to the trivial statement that the perimeter of a convex polygon is equal to the sum of the lengths of its edges. If K is any closed bounded convex set of dimension at most d, we may write KaEczE and use md(K) and mn(K) to denote the mean widths of K relative to the spaces E and E respectively. A simple calculation shows that for all such K, mn(K) is a constant multiple of md(K), to be precise, mn(K) md{K)

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lower Bounds for Differential Privacy from Gaussian Width

We study the optimal sample complexity of a given workload of linear queries under the constraints of differential privacy. The sample complexity of a query answering mechanism under error parameter α is the smallest n such that the mechanism answers the workload with error at most α on any database of size n. Following a line of research started by Hardt and Talwar [STOC 2010], we analyze samp...

متن کامل

The Mean Width of Circumscribed Random Polytopes Dedicated to Professor Tibor Bisztriczky on the occasion of his 60th birthday

For a given convex body K in Rd, a random polytope K(n) is defined (essentially) as the intersection of n independent closed halfspaces containing K and having an isotropic and (in a specified sense) uniform distribution. We prove upper and lower bounds of optimal orders for the difference of the mean widths of K(n) and K as n tends to infinity. For a simplicial polytope P, a precise asymptotic...

متن کامل

On the Combinatorial Complexity of Approximating Polytopes

Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body K of diameter diam(K) is given in Euclidean d-dimensional space, where d is a constant. Given an error parameter ε > 0, the objective is to determine a polytope of minimum combinatorial complexity whose Hausdorff distance from K is at most ε · diam(K). By combinatorial complex...

متن کامل

The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width

We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure results in a polynomial-size linear programming description of the convex hull of all integer feasible solutions when the BCP that is given has bounded tree-width.

متن کامل

On the asymmetry constant of a body with few vertices

In this note we show that a non-degenerated polytope in IRn with n+k, 1 ≤ k < n, vertices is far from any symmetric body. We provide the asymptotically sharp estimates for the asymmetry constant of such polytopes. 0 Introduction and notations The canonical Euclidean inner product in IR is denoted by 〈·, ·〉, the norm in `p is denoted by ‖ · ‖p, 1 ≤ p ≤ ∞. By a convex body K ⊂ IR we shall always ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006