English
Related papers

Related papers: Approximating a convex body by a polytope using th…

200 papers

We prove that for any Borel probability measure $\mu$ on $\mathbb R^n$ there exists a set $X\subset \mathbb R^n$ of $n+1$ points such that any $n$-variate quadratic polynomial $P$ that is nonnegative on $X$ (i.e. $P(x)\geq 0$, for every $x…

Metric Geometry · Mathematics 2023-08-29 Pablo González-Mazón , Alfredo Hubard , Roman Karasev

We investigate some combinatorial properties of convex polytopes simple in edges. For polytopes whose nonsimple vertices are located sufficiently far one from another, we prove an analog of the Hard Lefschetz theorem. It implies Stanley's…

Algebraic Geometry · Mathematics 2007-05-23 Vladlen Timorin

We show that in any $d$-dimensional real normed space, unit balls can be packed with density at least \[\frac{(1-o(1))d\log d}{2^{d+1}},\] improving a result of Schmidt from 1958 by a logarithmic factor and generalizing the recent result of…

Metric Geometry · Mathematics 2025-04-23 Carl Schildkraut

For a compact convex set $K$ and a Poisson point process $\eta$, the union of all Voronoi cells with a nucleus in $K$ is the Poisson-Voronoi approximation of $K$. Lower and upper bounds for the variance and a central limit theorem for the…

Probability · Mathematics 2011-12-26 Matthias Schulte

We show that there exist k-neighborly centrally symmetric d-dimensional polytopes with 2(n+d) vertices, where k(d,n)=Theta(d/(1+log ((d+n)/d))). We also show that this bound is tight.

Combinatorics · Mathematics 2007-05-23 Nathan Linial , Isabella Novik

Every convex body K in R^n has a coordinate projection PK that contains at least vol(0.1 K) cells of the integer lattice PZ^n, provided this volume is at least one. Our proof of this counterpart of Minkowski's theorem is based on an…

Functional Analysis · Mathematics 2016-12-23 Roman Vershynin

Let K be a convex set in R d and let K $\lambda$ be the convex hull of a homogeneous Poisson point process P $\lambda$ of intensity $\lambda$ on K. When K is a simple polytope, we establish scaling limits as $\lambda$ $\rightarrow$ $\infty$…

Probability · Mathematics 2016-02-22 Pierre Calka , J. E. Yukich

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

Metric Geometry · Mathematics 2022-03-23 Brett Leroux , Luis Rademacher

We prove several results of the following type: any $d$ measures in $\mathbb R^d$ can be partitioned simultaneously into $k$ equal parts by a convex partition (this particular result is proved independently by Pablo Sober\'on). Another…

Metric Geometry · Mathematics 2013-06-17 R. N. Karasev

Let $\Lambda \subset \mathbb R^n$ be an algebraic lattice, coming from a projective module over the ring of integers of a number field $K$. Let $\mathcal Z \subset \mathbb R^n$ be the zero locus of a finite collection of polynomials such…

Number Theory · Mathematics 2018-02-01 Lenny Fukshansky , Nikolay Moshchevitin

The (k,d)-hypersimplex is a (d-1)-dimensional polytope whose vertices are the (0,1)-vectors that sum to k. When k=1, we get a simplex whose graph is the complete graph with d vertices. Here we show how many of the well known graph…

Combinatorics · Mathematics 2008-11-19 Fred J. Rispoli

A celebrated theorem due to Bannai-Bannai-Stanton says that if $A$ is a set of points in $\mathbb{R}^{d}$, which determines $s$ distinct distances, then $$|A| \leq {d+s \choose s}.$$ In this note, we give a new simple proof of this result…

Combinatorics · Mathematics 2019-12-18 Fedor Petrov , Cosmin Pohoata

Let $d$ and $n$ be natural numbers. Let $\nu_{d,n}: \mathbb{R}^n\rightarrow \mathbb{R}^{N}$ denote the Veronese embedding with $N=N_{n,d}:=\binom{n+d-1}{d}$, defined by listing all the monomials of degree $d$ in $n$ variables using the…

Number Theory · Mathematics 2025-06-10 Daniel Flores , Kiseok Yeon

Let $K$ be a convex body in $\mathbb{R}^{n}$. Let $ d_{n,n-1}(K)$ be the smallest possible density of a non-separable lattice of translates of $K$. In this paper we prove the estimate $d_{2,1}(K)\leq \frac{\pi\sqrt{3}}{8}$ for $K\subset…

Metric Geometry · Mathematics 2022-08-03 Arkadiy Aliev

Kim, K\"uhn, Osthus and Tyomkyn (Trans. Amer. Math. Soc. 371 (2019), 4655--4742) greatly extended the well-known blow-up lemma of Koml\'os, S\'ark\"ozy and Szemer\'edi by proving a `blow-up lemma for approximate decompositions' which states…

Combinatorics · Mathematics 2020-01-13 Stefan Ehard , Felix Joos

Short and transparent proofs of central limit theorems for intrinsic volumes of random polytopes in smooth convex bodies are presented. They combine different tools such as estimates for floating bodies with Stein's method from probability…

Metric Geometry · Mathematics 2017-11-06 Christoph Thaele , Nicola Turchi , Florian Wespi

For natural numbers $n$ and $l > d \geq 2$, let $ES_d(l,n)$ be the minimum $N$ such that any set of at least $N$ points in $\mathbb{R}^d$ contains either $l$ points contained in a common $(d-1)$-dimensional hyperplane or $n$ points in…

Combinatorics · Mathematics 2025-06-02 Koki Furukawa

A random spherical polytope $P_n$ in a spherically convex set $K \subset S^d$ as considered here is the spherical convex hull of $n$ independent, uniformly distributed random points in $K$. The behaviour of $P_n$ for a spherically convex…

Probability · Mathematics 2015-05-19 Imre Bárány , Daniel Hug , Matthias Reitzner , Rolf Schneider

The direct and inverse theorems are established for the best approximation in the weighted $L^p$ space on the unit sphere of $\RR^{d+1}$, in which the weight functions are invariant under finite reflection groups. The theorems are stated…

Classical Analysis and ODEs · Mathematics 2007-05-23 Yuan Xu

We present an efficient algorithm for uniformly sampling from an arbitrary compact body $\mathcal{X} \subset \mathbb{R}^n$ from a warm start under isoperimetry and a natural volume growth condition. Our result provides a substantial common…

Data Structures and Algorithms · Computer Science 2026-03-27 Santosh S. Vempala , Andre Wibisono
‹ Prev 1 8 9 10 Next ›