English
Related papers

Related papers: Maximal surface area of polytopes with respect to …

200 papers

It was shown by K. Ball and F. Nazarov, that the maximal surface area of a convex set in $\mathbb{R}^n$ with respect to the Standard Gaussian measure is of order $n^{\frac{1}{4}}$. In the present paper we establish the analogous result for…

Classical Analysis and ODEs · Mathematics 2014-09-08 Galyna Livshyts

Let $p$ be a positive number. Consider probability measure $\gamma_p$ with density $\varphi_p(y)=c_{n,p}e^{-\frac{|y|^p}{p}}$. We show that the maximal surface area of a convex body in $\mathbb{R}^n$ with respect to $\gamma_p$ is…

Classical Analysis and ODEs · Mathematics 2016-06-08 Galyna Livshyts

In this note we study the maximal perimeter of a convex set in $\mathbb{R}^n$ with respect to various classes of measures. Firstly, we show that for a probability measure $\mu$ on $ \mathbb{R}^n$, satisfying very mild assumptions, there…

Metric Geometry · Mathematics 2019-05-01 Galyna V. Livshyts

In this paper we introduce a new sequence of quantities for random polytopes. Let $K_N=\conv\{X_1,...,X_N\}$ be a random polytope generated by independent random vectors uniformly distributed in an isotropic convex body $K$ of $\R^n$. We…

Functional Analysis · Mathematics 2012-11-13 David Alonso-Gutierrez , Nikos Dafnis , Maria A. Hernandez Cifre , Joscha Prochno

Let K be a convex body in $R^d$. A random polytope is the convex hull $[x_1,...,x_n]$ of finitely many points chosen at random in K. $\Bbb E(K,n)$ is the expectation of the volume of a random polytope of n randomly chosen points. I.…

Metric Geometry · Mathematics 2016-09-06 Carsten Schütt

Let $K$ be a convex body in $\mathbb{R}^n$ and $f : \partial K \rightarrow \mathbb{R}_+$ a continuous, strictly positive function with $\int\limits_{\partial K} f(x) d \mu_{\partial K}(x) = 1$. We give an upper bound for the approximation…

Metric Geometry · Mathematics 2017-07-07 Julian Grote , Elisabeth M. Werner

Let $K$ be an isotropic symmetric convex body in ${\mathbb R}^n$. We show that a subspace $F\in G_{n,n-k}$ of codimension $k=\gamma n$, where $\gamma\in (1/\sqrt{n},1)$, satisfies $$K\cap F\subseteq \frac{c}{\gamma }\sqrt{n}L_K (B_2^n\cap…

Metric Geometry · Mathematics 2016-09-29 Apostolos Giannopoulos , Labrini Hioni , Antonis Tsolomitis

It is known that random convex polygonal lines on $\mathbb{Z}_+^2$ (with the endpoints fixed at $0=(0,0)$ and $n=(n_1,n_2)\to\infty$) have a limit shape with respect to the uniform probability measure, identified as the parabola arc…

Probability · Mathematics 2011-11-01 Leonid V. Bogachev , Sakhavat M. Zarbaliev

We study approximations of smooth convex bodies by random ball-polytopes. We examine the following probability model: let $K\subset{\bf R}^d$ be a convex body such that $K$ slides freely in a ball of radius $R>0$ and has $C^2$ smooth…

Metric Geometry · Mathematics 2020-08-07 Ferenc Fodor

Approximating convex bodies is a fundamental problem in geometry. Given a convex body $K$ in $\mathbb{R}^d$ for a fixed dimension $d$, the objective is to minimize the number of facets of an approximating polytope for a given Hausdorff…

Computational Geometry · Computer Science 2026-01-26 Sunil Arya , Guilherme D. da Fonseca , David M. Mount

Approximating convex bodies is a fundamental question in geometry, which has a wide variety of applications. Given a convex body $K$ in $\textbf{R}^d$ for fixed $d$, the objective is to minimize the number of facets of an approximating…

Computational Geometry · Computer Science 2026-01-26 Sunil Arya , David M. Mount

Denote by ${\mathcal K}^d$ the family of convex bodies in $E^d$ and by $w(C)$ the minimal width of $C \in {\mathcal K}^d$. We ask for the greatest number $\Lambda_n ({\mathcal K}^d)$ such that every $C \in {\mathcal K}^d$ contains a…

Metric Geometry · Mathematics 2017-03-30 Marek Lassak

For a convex body $K \subset {\mathbb R}^n$, let $K^z = \{y\in{\mathbb R}^n : \langle y-z, x-z\rangle\le 1, \mbox{\ for all\ } x\in K\}$ be the polar body of $K$ with respect to the center of polarity $z \in {\mathbb R}^n$. The goal of this…

Metric Geometry · Mathematics 2017-08-29 Matthew Alexander , Matthieu Fradelizi , Artem Zvavitch

For an isotropic convex body $K\subset\mathbb{R}^n$ we consider the isotropic constant $L_{K_N}$ of the symmetric random polytope $K_N$ generated by $N$ independent random points which are distributed according to the cone probability…

Metric Geometry · Mathematics 2018-07-09 Joscha Prochno , Christoph Thäle , Nicola Turchi

We study the maximal perimeter constant of isotropic log-concave probability measures on $\mathbb{R}^n$. For a measure $\mu$, this quantity, denoted by $\Gamma(\mu)$, is defined as the supremum of the $\mu$-perimeter over all convex bodies…

Metric Geometry · Mathematics 2026-02-04 Silouanos Brazitikos , Apostolos Giannopoulos , Antonios Hmadi , Natalia Tziotziou

We consider the following geometric optimization problem: find a convex polygon of maximum area contained in a given simple polygon $P$ with $n$ vertices. We give a randomized near-linear-time $(1-\varepsilon)$-approximation algorithm for…

Computational Geometry · Computer Science 2017-10-17 Sergio Cabello , Josef Cibulka , Jan Kynčl , Maria Saumell , Pavel Valtr

A convex polygon Q is circumscribed about a convex polygon P if every vertex of P lies on at least one side of Q. We present an algorithm for finding a maximum area convex polygon circumscribed about any given convex n-gon in O(n^3) time.…

Metric Geometry · Mathematics 2024-03-25 Markus Ausserhofer , Susanna Dann , Zsolt Lángi , Géza Tóth

Given $N$ geodesic caps on the unit sphere in $\mathbb{R}^d$, and whose total normalized surface area sums to one, what is the maximal surface area their union can cover? In this work, we provide an asymptotically sharp upper bound for an…

Metric Geometry · Mathematics 2025-12-25 Steven Hoehner , Gil Kur

We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…

Combinatorics · Mathematics 2022-09-16 Hariharan Narayanan , Rikhav Shah , Nikhil Srivastava

Let $K \subset \R^d$ be a smooth convex set and let $\P_\la$ be a Poisson point process on $\R^d$ of intensity $\la$. The convex hull of $\P_\la \cap K$ is a random convex polytope $K_\la$. As $\la \to \infty$, we show that the variance of…

Probability · Mathematics 2012-06-22 Pierre Calka , J. E. Yukich
‹ Prev 1 2 3 10 Next ›