English
Related papers

Related papers: A Sharp Bound on Large Planar Signed Vector Sums

200 papers

The symmetries of surfaces which can be embedded into the symmetries of the 3-dimensional Euclidean space $\mathbb{R}^3$ are easier to feel by human's intuition. We give the maximum order of finite group actions on $(\mathbb{R}^3, \Sigma)$…

Geometric Topology · Mathematics 2017-04-24 Chao Wang , Shicheng Wang , Yimu Zhang , Bruno Zimmermann

For a collection of convex bodies $P_1,\dots,P_n \subset \mathbb{R}^d$ containing the origin, a Minkowski complex is given by those subsets whose Minkowski sum does not contain a fixed basepoint. Every simplicial complex can be realized as…

Combinatorics · Mathematics 2018-03-16 Florian Frick , Raman Sanyal

We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize the geometry of the graph. In many interesting cases, the existence of…

Metric Geometry · Mathematics 2011-07-26 Jonathan A. Kelner , James R. Lee , Gregory N. Price , Shang-Hua Teng

In this paper, we study the anisotropic Minkowski problem. It is a problem of prescribing the anisotropic Gauss-Kronecker curvature for a closed strongly convex hypersurface in Euclidean space as a function on its anisotropic normals in…

Analysis of PDEs · Mathematics 2017-05-30 Chao Xia

In $\mathbb{R}^n$, we establish an asymptotically sharp upper bound for the upper Minkowski dimension of $k$-porous sets having holes of certain size near every point in $k$ orthogonal directions at all small scales. This bound tends to…

Classical Analysis and ODEs · Mathematics 2017-01-31 Esa Järvenpää , Maarit Järvenpää , Antti Käenmäki , Ville Suomala

We consider the Tarski--Bang problem about covering of convex bodies by planks. The results of this kind give a lower bound on the sum of widths of planks (regions between a pair of parallel hyperplanes) covering a given convex body.…

Metric Geometry · Mathematics 2020-02-18 Arseniy Akopyan , Roman Karasev , Fedor Petrov

We compute the (unbounded) Newton-Okounkov body of the Hilbert scheme of points on $\mathbb C^2$. We obtain an upper bound for the Newton-Okounkov body of the Hilbert scheme of points on any smooth toric surface. We conjecture that this…

Algebraic Geometry · Mathematics 2022-03-08 Ian Cavey

Let $K$ be a centrally symmetric spherical and simplicial polytope, whose vertices form a $\frac{1}{4n}-$net in the unit sphere in $\mathbb{R}^n$. We prove a uniform lower bound on the norms of all hyperplane projections $P: X \to X$, where…

Functional Analysis · Mathematics 2022-11-10 Tomasz Kobos

Motivated by the central limit problem for convex bodies, we study normal approximation of linear functionals of high-dimensional random vectors with various types of symmetries. In particular, we obtain results for distributions which are…

Probability · Mathematics 2016-09-07 Elizabeth S. Meckes , Mark W. Meckes

We introduce and study four optimization problems that generalize the well-known subset sum problem. Given a node-weighted digraph, select a subset of vertices whose total weight does not exceed a given budget. Some additional constraints…

Computational Complexity · Computer Science 2016-09-06 Laurent Gourvès , Jérôme Monnot , Lydia Tlilane

We sharpen the moment comparison inequalities with sharp constants for sums of random vectors uniform on Euclidean spheres, providing a deficit term (optimal in high dimensions).

Probability · Mathematics 2026-03-05 Jacek Jakimiuk , Colin Tang , Tomasz Tkocz

Based on a novel type of Sobolev-Poincar\'e inequality (for generalised weakly differentiable functions on varifolds), we establish a finite upper bound of the geodesic diameter of generalised compact connected surfaces-with-boundary of…

Differential Geometry · Mathematics 2024-08-30 Ulrich Menne , Christian Scharrer

If the n-dimensional unit sphere is covered by finitely many spherically convex bodies, then the sum of the inradii of these bodies is at least {\pi}. This bound is sharp, and the equality case is characterized.

Metric Geometry · Mathematics 2011-10-20 Karoly Bezdek , Rolf Schneider

In [1] the problem of finding a sharp lower bound on lower against number of a general graph is mentioned as an open question. We solve the problem by establishing a tight lower bound on lower against number of a general graph in terms of…

Combinatorics · Mathematics 2019-08-27 Babak Samadi

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…

Optimization and Control · Mathematics 2024-12-11 Gabriela Kováčová , Birgit Rudloff

We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…

Combinatorics · Mathematics 2020-07-14 Peter Boyvalenkov , Maya Stoyanova

Upper and lower bounds are derived for the Gaussian mean width of the intersection of a convex hull of $M$ points with an Euclidean ball of a given radius. The upper bound holds for any collection of extreme point bounded in Euclidean norm.…

Statistics Theory · Mathematics 2017-09-28 Pierre C Bellec

We generalize the Fenchel theorem for strong spacelike closed curves of index $1$ in the 3-dimensional Minkowski space, showing that the total curvature must be less than or equal to $2\pi$. Here strong spacelike means that the tangent…

Differential Geometry · Mathematics 2016-03-28 Nan Ye , Xiang Ma

We consider the problem of assigning radii to a given set of points in the plane, such that the resulting set of circles is connected, and the sum of radii is minimized. We show that the problem is polynomially solvable if a connectivity…

A classical result of Dowker (Bull. Amer. Math. Soc. 50: 120-122, 1944) states that for any plane convex body $K$ in the Euclidean plane, the areas of the maximum (resp. minimum) area convex $n$-gons inscribed (resp. circumscribed) in $K$…

Metric Geometry · Mathematics 2024-03-26 Bushra Basit , Zsolt Lángi
‹ Prev 1 4 5 6 7 8 10 Next ›