English
Related papers

Related papers: New estimates for $d_{2,1}$ and $d_{3,2}$

200 papers

The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…

Metric Geometry · Mathematics 2025-03-31 Lenny Fukshansky

For $e \in S^{2}$, the unit sphere in $\mathbb{R}^3$, let $\pi_{e}$ be the orthogonal projection to $e^{\perp} \subset \mathbb{R}^{3}$, and let $W \subset \mathbb{R}^{3}$ be any $2$-plane, which is not a subspace. We prove that if $K…

Classical Analysis and ODEs · Mathematics 2018-08-10 Tuomas Orponen , Laura Venieri

We introduce a new variant of quantitative Helly-type theorems: the minimal \emph{"homothetic distance"} of the intersection of a family of convex sets to the intersection of a subfamily of a fixed size. As an application, we establish the…

Metric Geometry · Mathematics 2021-11-03 Grigory Ivanov , Márton Naszódi

A popular class of problem in statistics deals with estimating the support of a density from $n$ observations drawn at random from a $d$-dimensional distribution. The one-dimensional case reduces to estimating the end points of a univariate…

Statistics Theory · Mathematics 2018-04-27 Victor-Emmanuel Brunel , Jason M. Klusowski , Dana Yang

We obtain a new extension of Rogers-Shephard inequality providing an upper bound for the volume of the sum of two convex bodies $K$ and $L$. We also give lower bounds for the volume of the $k$-th limiting convolution body of two convex…

Metric Geometry · Mathematics 2013-12-23 David Alonso-Gutiérrez , Bernardo González , Carlos Hugo Jiménez

In 1978, Makai Jr. established a remarkable connection between the volume-product of a convex body, its maximal lattice packing density and the minimal density of a lattice arrangement of its polar body intersecting every affine hyperplane.…

Metric Geometry · Mathematics 2016-05-03 Bernardo González Merino , Matthias Henze

We study density estimation in Kullback-Leibler divergence: given an i.i.d. sample from an unknown density $p^\star$, the goal is to construct an estimator $\widehat{p}$ such that $\mathrm{KL}(p^\star,\widehat{p})$ is small with high…

Statistics Theory · Mathematics 2026-04-03 Spencer Compton , Gábor Lugosi , Jaouad Mourtada , Jian Qian , Nikita Zhivotovskiy

Let $K$ and $K_0$ be convex bodies in $\mathbb{R}^d$, such that $K$ contains the origin, and define the process $(K_n, p_n)$, $n \geq 0$, as follows: let $p_{n+1}$ be a uniform random point in $K_n$, and set $K_{n+1} = K_n \cap (p_{n+1} +…

Probability · Mathematics 2014-06-26 Péter Kevei , Viktor Vígh

We study the time complexity of the discrete $k$-center problem and related (exact) geometric set cover problems when $k$ or the size of the cover is small. We obtain a plethora of new results: - We give the first subquadratic algorithm for…

Computational Geometry · Computer Science 2023-05-04 Timothy M. Chan , Qizheng He , Yuancheng Yu

Let $K$ be a convex body in ${\mathbb R}^n$, and let $\Pi_1({\mathbb R}^n)$ be the space of polynomials in $n$ variables of degree at most $1$. Given an $(n+1)$-element set $Y\subset K$ in general position, we let $P_Y$ denote the Lagrange…

Metric Geometry · Mathematics 2024-09-30 Mikhail Nevskii

Let $ES_{d}(n)$ be the smallest integer such that any set of $ES_{d}(n)$ points in $\mathbb{R}^{d}$ in general position contains $n$ points in convex position. In 1960, Erd\H{o}s and Szekeres showed that $ES_{2}(n) \geq 2^{n-2} + 1$ holds,…

Combinatorics · Mathematics 2022-08-10 Cosmin Pohoata , Dmitrii Zakharov

Let $K \subset \mathbb{C}^n$ be a compact set satisfying the following Bernstein inequality: for any $m \in \{ 1,..., n\}$ and for any $n$-variate polynomial $P$ of degree $\mbox{deg}(P)$ we have \begin{align*} \max_{z\in…

Complex Variables · Mathematics 2023-09-04 Dimitri Jordan Kenne

A packing of translates of a convex body in the $d$-dimensional Euclidean space $\mathbb{E}^d$ is said to be totally separable if any two packing elements can be separated by a hyperplane of $\mathbb{E}^{d}$ disjoint from the interior of…

Metric Geometry · Mathematics 2020-02-12 Károly Bezdek , Zsolt Lángi

We consider a compact convex body $\mathcal{B}$ in $\mathbb{R}^d$ $(d\geqslant 3)$ with smooth boundary and nonzero Gaussian curvature and prove a new estimate of $P_{\mathcal{B}}(t)$, the remainder in the lattice point problem, which…

Number Theory · Mathematics 2010-07-27 Jingwei Guo

Let $K$ be an $n$-dimensional convex body. Define the difference body by $$ K-K= \{x-y \mid x,y \in K \}. $$ We estimate the volume of the section of $K-K$ by a linear subspace $F$ via the maximal volume of sections of $K$ parallel to $F$.…

Functional Analysis · Mathematics 2007-05-23 M. Rudelson

A lattice (d, k)-polytope is the convex hull of a set of points in dimension d whose coordinates are integers between 0 and k. Let {\delta}(d, k) be the largest diameter over all lattice (d, k)-polytopes. We develop a computational…

Computational Geometry · Computer Science 2017-04-07 Nathan Chadder , Antoine Deza

It is proved that for a symmetric convex body K in R^n, if for some tau > 0, |K cap (x+tau K)| depends on ||x||_K only, then K is an ellipsoid. As a part of the proof, smoothness properties of convolution bodies ls are studied.

Functional Analysis · Mathematics 2016-09-06 Mathieu Meyer , Shlomo Reisner , M. Schmuckenschlager

Given a convex disk $K$ and a positive integer $k$, let $\vartheta_T^k(K)$ and $\vartheta_L^k(K)$ denote the $k$-fold translative covering density and the $k$-fold lattice covering density of $K$, respectively. Let $T$ be a triangle. In a…

Metric Geometry · Mathematics 2016-01-19 Kirati Sriamorn , Akanat Wetayawanich

$ \newcommand{\R}{\mathbb{R}} \newcommand{\lat}{\mathcal{L}} $We prove a conjecture due to Dadush, showing that if $\lat \subset \R^n$ is a lattice such that $\det(\lat') \ge 1$ for all sublattices $\lat' \subseteq \lat$, then \[ \sum_{\vec…

Metric Geometry · Mathematics 2022-07-08 Oded Regev , Noah Stephens-Davidowitz

The Separation Problem asks for the minimum number s(O,K) of hyperplanes required to strictly separate any interior point O of a convex body K from all faces of K. The Conjecture is s(O,K) is at most 2 to the power d in real d-space , and…

Combinatorics · Mathematics 2017-03-14 T. Bisztriczky
‹ Prev 1 3 4 5 6 7 10 Next ›