English
Related papers

Related papers: Covering a reduced spherical body by a disk

200 papers

In 1957, Hadwiger conjectured that every convex body in $\mathbb{R}^d$ can be covered by $2^d$ translates of its interior. For over 60 years, the best known bound was of the form $O(4^d \sqrt{d} \log d)$, but this was recently improved by a…

Metric Geometry · Mathematics 2022-06-23 Marcelo Campos , Peter van Hintum , Robert Morris , Marius Tiba

A gap in the proof prevents us to show that surfaces with constant mean curvature closed to 1/2 in H2 X R and having boundary with curvature greater than one, contained in a horizontal section P of H2 X R are topological disks, provided…

Differential Geometry · Mathematics 2019-10-29 Vlad Moraru , Barbara Nelli

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

Metric Geometry · Mathematics 2024-02-08 Bushra Basit , Zsolt Lángi

Let $M$ be a $2$-space form. Let $P$ be a convex polygon in $M$. For these polygons, we define (and justify) a curvature $\kappa_i$ at each vertex $A_i$ of the polygon and and prove the following Blaschke's type theorem: If $P$ is a convex…

Differential Geometry · Mathematics 2023-05-15 Alexander Borisenko , Vicente Miquel

We give two new upper bounds on the covering minima of convex bodies, depending on covering minima of certain projections and intersections with linear subspaces. We show one bound to be sharp for direct sums of two convex bodies,…

Combinatorics · Mathematics 2026-05-12 Katarina Krivokuća

We outline a new method suggested by Conway (2016) for solving the two-body problem for solid bodies of spheroidal or ellipsoidal shape. The method is based on integrating the gravitational potential of one body over the surface of the…

Earth and Planetary Astrophysics · Physics 2021-06-28 M. Wold , J. T. Conway

Spherical coverings on the S2 sphere and their algebraic numbers are given for the putatively optimal global solutions for some n-congruent spherical caps with minimal radius to completely cover the S2 sphere. A few locally optimal…

Metric Geometry · Mathematics 2020-08-12 Randall L. Rathbun

Let $K\subset\mathbb S^{d-1}$ be a convex spherical body. Denote by $\Delta(K)$ the distance between two random points in $K$ and denote by $\sigma(K)$ the length of a random chord of $K$. We explicitly express the distribution of…

Probability · Mathematics 2020-07-16 Tatiana Moseeva , Alexander Tarasov , Dmitry Zaporozhets

This work revolves around the two following questions: Given a convex body $C\subset\mathbb{R}^d$, a positive integer $k$ and a finite set $S\subset\mathbb{R}^d$ (or a finite Borel measure $\mu$ on $\mathbb{R}^d$), how many homothets of $C$…

Combinatorics · Mathematics 2022-12-06 Oriol Solé Pi

We consider a convex solid cone $\mathcal{C}\subset\mathbb{R}^{n+1}$ with vertex at the origin and boundary $\partial\mathcal{C}$ smooth away from $0$. Our main result shows that a compact two-sided hypersurface $\Sigma$ immersed in…

Differential Geometry · Mathematics 2023-02-14 César Rosales

Let $H_n$ be the minimal number such that any $n$-dimensional convex body can be covered by $H_n$ translates of interior of that body. Similarly $H_n^s$ is the corresponding quantity for symmetric bodies. It is possible to define $H_n$ and…

Metric Geometry · Mathematics 2024-04-02 Andrii Arman , Andriy Bondarenko , Andriy Prymak

In this paper, it is shown that for any two non-empty closed (resp., open) and spherical convex subsets $\mathcal{W}_1, \mathcal{W}_2$ of $S^n$, the intersection $\mathcal{W}_1\cap \mathcal{W}_2$ is empty if and only if the subset $\{P\in…

Metric Geometry · Mathematics 2020-02-18 Huhe Han , Takashi Nishimura

The $k$-coverage problem is to find the minimum number of disks such that each point in a given plane is covered by at least $k$ disks. Under unit disk condition, when $k$=1, this problem has been solved by Kershner in 1939. However, when…

Metric Geometry · Mathematics 2016-04-21 Jingchao Chen

Coverings of convex bodies have emerged as a central component in the design of efficient solutions to approximation problems involving convex bodies. Intuitively, given a convex body $K$ and $\epsilon> 0$, a covering is a collection of…

Computational Geometry · Computer Science 2023-03-16 Sunil Arya , Guilherme D. da Fonseca , David M. Mount

The convex shape contained in a disk having prescribed area and maximal perimeter is completely characterized in terms of the area fraction. The solution is always a polygon having all but one sides equal. The lengths of the sides are…

Metric Geometry · Mathematics 2024-02-09 Beniamin Bogosel

We introduce and study certain notions which might serve as substitutes for maximum density packings and minimum density coverings. A body is a compact connected set which is the closure of its interior. A packing $\cal P$ with congruent…

Metric Geometry · Mathematics 2009-09-25 Gabor Fejes Tóth , Greg Kuperberg , Włodzimierz Kuperberg

The current work focuses on the Gaussian-Minkowski problem in dimension 2. In particular, we show that if the Gaussian surface area measure is proportional to the spherical Lebesgue measure, then the corresponding convex body has to be a…

Metric Geometry · Mathematics 2023-03-31 Shibing Chen , Shengnan Hu , Weiru Liu , Yiming Zhao

We show that the diameter of the image of the skinning map on the deformation space of an acylindrical reflection group is bounded by a constant depending only on the topological complexity of the components of its boundary, answering a…

Geometric Topology · Mathematics 2025-11-07 Yusheng Luo , Yongquan Zhang

Although the Sierpi\'nski triangle has planar area $0$, it is uniformly non-flat: at every point and every scale, its nearby points span a two-dimensional region of comparable size. We prove a sharp version of this statement, showing that…

Metric Geometry · Mathematics 2026-05-05 Scott Duke Kominers

We provide the solution for a fundamental problem of geometric optimization by giving a complete characterization of worst-case optimal disk coverings of rectangles: For any $\lambda\geq 1$, the critical covering area $A^*(\lambda)$ is the…

Computational Geometry · Computer Science 2020-03-19 Sándor P. Fekete , Utkarsh Gupta , Phillip Keldenich , Christian Scheffer , Sahil Shah
‹ Prev 1 3 4 5 6 7 10 Next ›