中文
相关论文

相关论文: Best and random approximation of a convex body by …

200 篇论文

We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…

组合数学 · 数学 2025-06-02 Marie-Charlotte Brandenburg , Jesús A. De Loera , Chiara Meroni

We prove an exponential deviation inequality for the convex hull of a finite sample of i.i.d. random points with a density supported on an arbitrary convex body in $\R^d$, $d\geq 2$. When the density is uniform, our result yields rate…

概率论 · 数学 2017-04-07 Victor-Emmanuel Brunel

Polyhedral-type approximations of convex-like domains in $\mathbb{C}^d$ have been considered recently by the second author. In particular, the decay rate of the error in optimal volume approximation as a function of the number of facets has…

概率论 · 数学 2022-03-24 Siva Athreya , Purvi Gupta , D. Yogeshwaran

Given a convex body C in R^d containing the origin in its interior and a real number tau > 1 we seek to construct a polytope P in C with as few vertices as possible such that C in tau P. Our construction is nearly optimal for a wide range…

度量几何 · 数学 2012-07-09 Alexander Barvinok

Suppose we choose $N$ points uniformly randomly from a convex body in $d$ dimensions. How large must $N$ be, asymptotically with respect to $d$, so that the convex hull of the points is nearly as large as the convex body itself? It was…

概率论 · 数学 2020-09-22 Alan Frieze , Wesley Pegden , Tomasz Tkocz

The deviation of a general convex body with twice differentiable boundary and an arbitrarily positioned polytope with a given number of vertices is studied. The paper considers the case where the deviation is measured in terms of the…

度量几何 · 数学 2018-11-13 Julian Grote , Christoph Thaele , Elisabeth M. Werner

We investigate the intersection body of a convex polytope using tools from combinatorics and real algebraic geometry. In particular, we show that the intersection body of a polytope is always a semialgebraic set and provide an algorithm for…

The mixing operation for abstract polytopes gives a natural way to construct the minimal common cover of two polytopes. In this paper, we apply this construction to the regular convex polytopes, determining when the mix is again a polytope,…

组合数学 · 数学 2012-01-17 Gabe Cunningham

We survey results concerning sharp estimates on volumes of sections and projections of certain convex bodies, mainly $\ell_p$ balls, by and onto lower dimensional subspaces. This subject emerged from geometry of numbers several decades ago…

泛函分析 · 数学 2025-01-28 Piotr Nayar , Tomasz Tkocz

Let $\mu$ be a probability distribution on $\mathbb{R}^d$ which assigns measure zero to every hyperplane and $S$ a set of points sampled independently from $\mu$. What can be said about the expected combinatorial structure of the convex…

概率论 · 数学 2023-07-13 Brett Leroux

Considering simultaneous approximation to three numbers, we study the geometry of the sequence of best approximations. We provide a sharper lower bound for the ratio between ordinary and uniform exponent of Diophantine approximation,…

数论 · 数学 2024-01-18 Antoine Marnat , Nikolay Moshchevitin

This article is a survey of recent results on slicing inequalities for convex bodies. The focus is on the setting of arbitrary measures in place of volume.

度量几何 · 数学 2015-11-18 Alexander Koldobsky

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…

计算几何 · 计算机科学 2026-01-26 Sunil Arya , David M. Mount

This paper studies best finitely supported approximations of one-dimensional probability measures with respect to the $L^r$-Kantorovich (or transport) distance, where either the locations or the weights of the approximations' atoms are…

概率论 · 数学 2019-03-06 Chuang Xu , Arno Berger

We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…

最优化与控制 · 数学 2024-12-11 Gabriela Kováčová , Birgit Rudloff

A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…

计算几何 · 计算机科学 2014-09-16 Danny Rorabaugh

A new and simple method for quasi-convex optimization is introduced from which its various applications can be derived. Especially, a global optimum under constrains can be approximated for all continuous functions.

最优化与控制 · 数学 2020-12-07 Sompong Dhompongsa , Poom Kumam

We consider the moments of the volume of the symmetric convex hull of independent random points in an $n$-dimensional symmetric convex body. We calculate explicitly the second and fourth moments for $n$ points when the given body is $B_q^n$…

度量几何 · 数学 2007-05-23 Mark W. Meckes

We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.

复变函数 · 数学 2017-09-26 Simon St-Amant , Jérémie Turcotte

We study the geometry of centrally-symmetric random polytopes, generated by $N$ independent copies of a random vector $X$ taking values in $\mathbb{R}^n$. We show that under minimal assumptions on $X$, for $N \gtrsim n$ and with high…