中文
相关论文

相关论文: On approximations by projections of polytopes with…

200 篇论文

We prove Gaussian approximation theorems for specific $k$-dimensional marginals of convex bodies which possess certain symmetries. In particular, we treat bodies which possess a 1-unconditional basis, as well as simplices. Our results…

度量几何 · 数学 2009-01-09 Mark W. Meckes

A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ vertices are not known when $s \ge 4$. In this paper, we construct a family of convex small $n$-gons, $n=2^s$…

最优化与控制 · 数学 2022-12-27 Christian Bingane

We study the computational complexity of determining the Hausdorff distance of two polytopes given in halfspace- or vertex-presentation in arbitrary dimension. Subsequently, a matching problem is investigated where a convex body is allowed…

计算几何 · 计算机科学 2014-01-08 Stefan König

Let us consider the set of all joint probabilities generated by local binary measurements on two separated quantum systems of a given local dimension d. We address the question of whether the shape of this quantum body is convex or not. We…

量子物理 · 物理学 2015-05-13 K. F. Pál , T. Vértesi

This paper is motivated by two problems in the theory of Diophantine approximation, namely, Davenport's problem regarding badly approximable points on submanifolds of a Euclidean space and Schmidt's problem regarding the intersections of…

数论 · 数学 2016-04-01 Victor Beresnevich

We prove that for any norm |*| in the d-dimensional real vector space V and for any odd n>0 there is a non-negative polynomial p(x), x in V of degree 2n such that p^{1/2n}(x) < |x| < c(n,d) p^{1/2n}(x), where c(n,d)={n+d-1 choose n}^{1/2n}.…

泛函分析 · 数学 2007-05-23 Alexander Barvinok

In this paper, we study the weighted $n$-dimensional badly approximable points on manifolds. Given a $C^n$ differentiable non-degenerate submanifold $\mathcal{U} \subset \mathbb{R}^n$, we will show that any countable intersection of the…

数论 · 数学 2019-05-02 Lei Yang

It was conjectured by Levi, Hadwiger, Gohberg and Markus that the boundary of any convex body in ${\mathbb R}^n$ can be illuminated by at most $2^n$ light sources, and, moreover, $2^n-1$ light sources suffice unless the body is a…

度量几何 · 数学 2017-10-17 Galyna Livshyts , Konstantin Tikhomirov

Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider a real projective manifold M which is obtained by gluing together the polytopes in P along their facets in such a way that the union of any two adjacent polytopes…

几何拓扑 · 数学 2007-05-29 Jaejeong Lee

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…

度量几何 · 数学 2020-08-07 Ferenc Fodor

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

Let $V\subset\R^m$ be a centrally symmetric convex body and let $V^*\subset\R^m$ be its polar. We prove limit relations between the sharp constants in the multivariate Markov-Bernstein-Nikolskii type inequalities for algebraic polynomials…

经典分析与常微分方程 · 数学 2020-02-27 Michael I. Ganzburg

We study the volume ratio between projections of two convex bodies. Given a high-dimensional convex body $K$ we show that there is another convex body $L$ such that the volume ratio between any two projections of fixed rank of the bodies…

度量几何 · 数学 2022-11-14 Daniel Galicer , Alexander E. Litvak , Mariano Merzbacher , Damián Pinasco

We show that a realization of a closed connected PL-manifold of dimension n-1 in Euclidean n-space (n>2) is the boundary of a convex polyhedron if and only if the interior of each (n-3)-face has a point, which has a neighborhood lying on…

度量几何 · 数学 2007-05-23 Konstantin Rybnikov

The Hirsch conjecture, posed in 1957, stated that the graph of a $d$-dimensional polytope or polyhedron with $n$ facets cannot have diameter greater than $n - d$. The conjecture itself has been disproved, but what we know about the…

组合数学 · 数学 2013-10-29 Francisco Santos

We give a review of results on the minimum convex cover and maximum hidden set problems. In addition, we give some new results. First we show that it is NP-hard to determine whether a polygon has the same convex cover number as its hidden…

计算几何 · 计算机科学 2026-04-30 Reilly Browne

A classical theorem of Alon and Milman states that any $d$ dimensional centrally symmetric convex body has a projection of dimension $m\geq e^{c\sqrt{\ln{d}}}$ which is either close to the $m$-dimensional Euclidean ball or to the…

度量几何 · 数学 2018-05-08 Marton Naszodi

We show that the non-symmetric Banach-Mazur distance between two convex bodies $K_1, K_2 \subseteq \mathbb{R}^n$ satisfies $$ d_{BM}(K_1, K_2) \leq C n \cdot \log^{\alpha} (n+1), $$ for universal constants $C, \alpha > 0$. This improves…

度量几何 · 数学 2025-11-06 Pierre Bizeul , Boaz Klartag

An infinitely smooth convex body in $\mathbb R^n$ is called polynomially integrable of degree $N$ if its parallel section functions are polynomials of degree $N$. We prove that the only smooth convex bodies with this property in odd…

度量几何 · 数学 2017-02-03 Alexander Koldobsky , Alexander Merkurjev , Vladyslav Yaskin

The Hirsch Conjecture stated that any $d$-dimensional polytope with n facets has a diameter at most equal to $n - d$. This conjecture was disproved by Santos (A counterexample to the Hirsch Conjecture, Annals of Mathematics, 172(1) 383-412,…

最优化与控制 · 数学 2025-04-22 Yaguang Yang