English
Related papers

Related papers: Improved bounds for Hadwiger's covering problem vi…

200 papers

This thesis consists of five papers about reduced spherical convex bodies and in particular spherical bodies of constant width on the $d$-dimensional sphere $S^d$. In paper I we present some facts describing the shape of reduced bodies of…

Metric Geometry · Mathematics 2024-09-12 Michał Musielak

We prove that if $G$ is an abelian group and $H_1x_1,\dots,H_{k}x_k$ is an irredundant (minimal) cover of $G$ with cosets, then $$|G:\bigcap_{i=1}^{k}H_{i}|=2^{O(k)}.$$ This bound is the best possible up to the constant hidden in the…

Combinatorics · Mathematics 2022-11-01 János Nagy , Péter Pál Pach , István Tomon

The paper is devoted to coverings by translative homothets and illuminations of convex bodies. For a given positive number $\alpha$ and a convex body $B$, $g_{\alpha}(B)$ is the infimum of $\alpha$-powers of finitely many homothety…

Metric Geometry · Mathematics 2021-07-21 Alexey Glazyrin

We consider the smallest-area universal covering of planar objects of perimeter 2 (or equivalently closed curves of length 2) allowing translation and discrete rotations. In particular, we show that the solution is an equilateral triangle…

Computational Geometry · Computer Science 2022-11-29 Mook Kwon Jung , Sang Duk Yoon , Hee-Kap Ahn , Takeshi Tokuyama

We perform an exhaustive study of the simplest, nontrivial problem in advection-diffusion -- a finite absorber of arbitrary cross section in a steady two-dimensional potential flow of concentrated fluid. This classical problem has been…

Soft Condensed Matter · Physics 2009-11-10 Jaehyuk Choi , Dionisios Margetis , Todd M. Squires , Martin Z. Bazant

We give some natural sufficient conditions for balls in a metric space to have small intersection. Roughly speaking, this happens when the metric space is (i) expanding and (ii) well-spread, and (iii) a certain random variable on the…

Combinatorics · Mathematics 2022-01-04 Jaehoon Kim , Hong Liu , Tuan Tran

We solve Talagrand's entropy problem: the L_2-covering numbers of every uniformly bounded class of functions are exponential in its shattering dimension. This extends Dudley's theorem on classes of {0,1}-valued functions, for which the…

Functional Analysis · Mathematics 2016-12-23 S. Mendelson , R. Vershynin

This article deals with the variable coefficient thin obstacle problem in $n+1$ dimensions. We address the regular free boundary regularity, the behavior of the solution close to the free boundary and the optimal regularity of the solution…

Analysis of PDEs · Mathematics 2016-03-23 Herbert Koch , Angkana Rüland , Wenhui Shi

In this paper, we study the prescribed $k$-th Weingarten curvature problem for convex capillary hypersurfaces in $\overline{\mathbb{R}^{n+1}_+}$. This problem naturally extends the prescribed $k$-th Weingarten curvature problem for closed…

Differential Geometry · Mathematics 2025-04-22 Xinqun Mei , Guofang Wang , Liangjun Weng

Arrangements of pseudolines are classic objects in discrete and computational geometry. They have been studied with increasing intensity since their introduction almost 100 years ago. The study of the number $B_n$ of non-isomorphic simple…

Combinatorics · Mathematics 2024-03-22 Fernando Cortés Kühnast , Justin Dallant , Stefan Felsner , Manfred Scheucher

For every hyperplane $H$ supporting a convex body $C$ in the hyperbolic space $\mathbb{H}^d$ we define the width of $C$ determined by $H$ as the distance between $H$ and a most distant ultraparallel hyperplane supporting $C$. We prove that…

Metric Geometry · Mathematics 2024-02-27 Marek Lassak

For integers $d \geq 2$ and $k \geq d+1$, a $k$-hole in a set $S$ of points in general position in $\mathbb{R}^d$ is a $k$-tuple of points from $S$ in convex position such that the interior of their convex hull does not contain any point…

Combinatorics · Mathematics 2022-02-08 Martin Balko , Manfred Scheucher , Pavel Valtr

A small polygon is a polygon of unit diameter. The maximal area of a small polygon with $n=2m$ vertices is not known when $m\ge 7$. Finding the largest small $n$-gon for a given number $n\ge 3$ can be formulated as a nonconvex quadratically…

Optimization and Control · Mathematics 2023-02-24 Christian Bingane

Recently, Gilmer proved the first constant lower bound for the union-closed sets conjecture via an information-theoretic argument. The heart of the argument is an entropic inequality involving the OR function of two i.i.d.\ binary vectors,…

Information Theory · Computer Science 2023-06-16 Jingbo Liu

An eigenvalue problem arising in optimal insulation related to the minimization of the heat decay rate of an insulated body is adapted to enforce a positive lower bound imposed on the distribution of insulating material. We prove the…

Numerical Analysis · Mathematics 2024-10-22 Sören Bartels , Giuseppe Buttazzo , Hedwig Keller

We obtain upper and lower bounds on the difference between the renormalized volume and the volume of the convex core of a convex cocompact hyperbolic 3-manifold which depend on the injectivity radius of the boundary of the universal cover…

Differential Geometry · Mathematics 2017-07-10 Martin Bridgeman , Richard Canary

We pose the problem of approximating optimally a given nonnegative signal with the scalar autoconvolution of a nonnegative signal. The I-divergence is chosen as the optimality criterion being well suited to incorporate nonnegativity…

Optimization and Control · Mathematics 2024-06-04 Lorenzo Finesso , Peter Spreij

We consider the width $X_T(\omega)$ of a convex $n$-gon $T$ in the plane along the random direction $\omega\in\mathbb{R}/2\pi \mathbb{Z}$ and study its deviation rate: $$…

Probability · Mathematics 2022-01-19 Shigeki Akiyama , Teturo Kamae

We prove that the density of any covering single-insertion code $C\subseteq X^r$ over the $n$-symbol alphabet $X$ cannot be smaller than $1/r+\delta_r$ for some positive real $\delta_r$ not depending on $n$. This improves the volume lower…

Combinatorics · Mathematics 2025-05-27 Oleg Pikhurko , Oleg Verbitsky , Maksim Zhukovskii

The convexity number of a set $X \subset \mathbb{R}^2$ is the minimum number of convex subsets required to cover it. We study the following question: what is the largest possible convexity number $f(n)$ of $\mathbb{R}^2 \setminus S$, where…

Combinatorics · Mathematics 2026-01-05 Chaya Keller , Micha A. Perles
‹ Prev 1 8 9 10 Next ›