English
Related papers

Related papers: A Note on the Size of the Largest Ball Inside a Co…

200 papers

Let $P$ be a bounded polyhedron defined as the intersection of the non-negative orthant ${\Bbb R}^n_+$ and an affine subspace of codimension $m$ in ${\Bbb R}^n$. We show that a simple and computationally efficient formula approximates the…

Metric Geometry · Mathematics 2022-06-28 Alexander Barvinok , Mark Rudelson

A symmetrization inequality of Rogers and of Brascamp-Lieb-Luttinger states that for a certain class of multilinear integral expressions, among tuples of sets of prescribed Lebesgue measures, tuples of balls centered at the origin are among…

Classical Analysis and ODEs · Mathematics 2017-12-04 Michael Christ , Kevin O'Neill

The maximal chain polytope $\mathscr{M}(P)$ is associated with a finite poset $P$. For a set of maximal chains $\mathcal{C}$, it is shown that the convex hull of all the points corresponding to elements of $\mathcal{C}$ is not a face of…

Combinatorics · Mathematics 2022-02-09 Shinsuke Odagiri

We consider the following geometric optimization problem: find a maximum-area rectangle and a maximum-perimeter rectangle contained in a given convex polygon with $n$ vertices. We give exact algorithms that solve these problems in time…

Computational Geometry · Computer Science 2014-10-08 Sergio Cabello , Otfried Cheong , Christian Knauer , Lena Schlipf

A skew Bollob\'{a}s system $\mathcal{P}=\{(A_i,B_i):1\leq i\leq m\}$ is a collection of pairs of disjoint subsets of $[n]$ such that $A_i\cap B_j\ne\emptyset$ for any $1\leq i<j\leq m$. Denote by $S_1(a, b)$ or $S_2(a, b)$ the maximum size…

Combinatorics · Mathematics 2026-05-01 Yu Fang , Tao Feng , Xiaomiao Wang

The integer hull of a polyhedron is the convex hull of the integer points contained in it. We show that the vertices of the integer hulls of a rational family of polyhedra of size O(n) have quasipolynomial coordinates. As a corollary, we…

Combinatorics · Mathematics 2013-07-17 Danny Calegari , Alden Walker

We describe the eigenvalues and the eigenspaces of the adjacency matrices of subgraphs of the Hamming cube induced by Hamming balls, and more generally, by a union of adjacent concentric Hamming spheres. As a corollary, we extend the range…

Combinatorics · Mathematics 2024-11-25 Amit Avni , Alex Samorodnitsky

Let $B$ be a Euclidean ball in ${\mathbb R}^n$ and let $C(B)$ be a space of~continuous functions $f:B\to{\mathbb R}$ with the uniform norm $\|f\|_{C(B)}:=\max_{x\in B}|f(x)|.$ By $\Pi_1\left({\mathbb R}^n\right)$ we mean a set of…

Metric Geometry · Mathematics 2021-06-15 Mikhail Nevskii

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

We study the set where the so-called Bergman representative coordinates (or Bergman functions) form an immersion. We provide an estimate of the size of a maximal geodesic ball with respect to the Bergman metric, contained in this set. By…

Complex Variables · Mathematics 2015-05-18 Zywomir Dinew

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 this paper we prove the Kneser-Poulsen conjecture for the case of large radii. Namely, if a finite number of points in Euclidean space $E^n$ is rearranged so that the distance between each pair of points does not decrease, then there…

Metric Geometry · Mathematics 2012-03-19 Igors Gorbovickis

In this article, we consider the problems of finding in $d+1$ dimensions a minimum-volume axis-parallel box, a minimum-volume arbitrarily-oriented box and a minimum-volume convex body into which a given set of $d$-dimensional unit-radius…

Computational Geometry · Computer Science 2025-09-30 Helmut Alt , Sergio Cabello , Otfried Cheong , Ji-won Park , Nadja Seiferth

In this paper we obtain order estimates for the Kolmogorov widths of the set $B_{p_0}^m\cap \nu B_{p_1}^m$ in $l_q^m$; here $0\le n\le m/2$, $p_0>p_1$, $q<\infty$.

Functional Analysis · Mathematics 2020-07-10 A. A. Vasil'eva

This note provides a simple proof for the equality between the normalized volume of a convex polytope with $m$ vertices and the mixed volume of $m$ simplices and thus shows the seemingly restrictive problem of computing mixed volume of…

Metric Geometry · Mathematics 2021-08-31 Tianran Chen

For $2 < p < p_0 \simeq 26.265$, the hyperplane section of the $l_p^n$-unit ball $B_p^n$ perpendicular to a^(n) = 1/sqrt(n) (1, ... ,1) for large $n$ has larger volume than the one orthogonal to a^(2) = 1/sqrt(2) (1,1,0, ...,0), as shown by…

Functional Analysis · Mathematics 2024-03-22 Hermann König

In this paper, we prove a geometrical inequality which states that for any four points on a hemisphere with the unit radius, the largest sum of distances between the points is 4+4*sqrt(2). In our method, we have constructed a rectangular…

Symbolic Computation · Computer Science 2022-01-04 Zhenbing Zeng , Jian Lu , Yaochen Xu , Yuzheng Wang

The positive semidefinite rank of a convex body $C$ is the size of its smallest positive semidefinite formulation. We show that the positive semidefinite rank of any convex body $C$ is at least $\sqrt{\log d}$ where $d$ is the smallest…

Optimization and Control · Mathematics 2017-12-06 Hamza Fawzi , Mohab Safey El Din

In this paper we study the space $\mathcal{M}$ of all nonempty compact metric spaces considered up to isometry, equipped with the Gromov--Hausdorff distance. We show that each ball in $\mathcal{M}$ with center at the one-point space is…

Metric Geometry · Mathematics 2018-04-24 Daria P. Klibus

The fixed length Levenshtein (FLL) distance between two words $\mathbf{x,y} \in \mathbb{Z}_m^n$ is the smallest integer $t$ such that $\mathbf{x}$ can be transformed to $\mathbf{y}$ by $t$ insertions and $t$ deletions. The size of a ball in…

Information Theory · Computer Science 2024-02-26 Geyang Wang , Qi Wang