English
Related papers

Related papers: On the Hadwiger covering problem in low dimensions

200 papers

We prove that the Hadwiger number of an $n$-vertex graph $G$ (the maximum size of a clique minor in $G$) cannot be computed in time $n^{o(n)}$, unless the Exponential Time Hypothesis (ETH) fails. This resolves a well-known open question in…

Data Structures and Algorithms · Computer Science 2020-04-27 Fedor V. Fomin , Daniel Lokshtanov , Ivan Mihajlin , Saket Saurabh , Meirav Zehavi

The lower dimensional Busemann-Petty problem asks whether origin symmetric convex bodies in $\mathbb{R}^n$ with smaller volume of all $k$-dimensional sections necessarily have smaller volume. As proved by Bourgain and Zhang, the answer to…

Functional Analysis · Mathematics 2007-05-23 V. Yaskin

We generalize the hyperplane inequality in dimensions up to 4 to the setting of arbitrary measures in place of the volume. To prove this generalization we establish stability in the affirmative part of the solution to the Busemann-Petty…

Metric Geometry · Mathematics 2011-02-22 Alexander Koldobsky

We obtain a substantially improved lower bound for the minimum overlap problem asked by Erd\H{o}s. Our approach uses elementary Fourier analysis to translate the problem to a convex optimization program.

Combinatorics · Mathematics 2022-01-19 Ethan Patrick White

Convex geometries are closure systems satisfying the anti-exchange axiom. Every finite convex geometry can be embedded into a convex geometry of finitely many points in an n-dimensional space equipped with a convex hull operator, by the…

Combinatorics · Mathematics 2016-09-02 Kira Adaricheva , Madina Bolat

In this paper, extending the work of Gal'perin (Comm. Math. Phys. 154: 63-84, 1993), we investigate generalizations of the concepts of centroids and static equilibrium points of a convex body in spherical, hyperbolic and normed spaces. In…

Metric Geometry · Mathematics 2026-02-11 Z. Lángi , S. Wang

We study the problem of computing a convex region with bounded area and diameter that contains the maximum number of points from a given point set $P$. We show that this problem can be solved in $O(n^6k)$ time and $O(n^3k)$ space, where $n$…

Computational Geometry · Computer Science 2025-07-08 Gianmarco Picarella , Marc van Kreveld , Frank Staals , Sjoerd de Vries

In this paper, an inverse initial-boundary value problem for the heat equation in three dimensions is studied. Assume that a three-dimensional heat conductive body contains several cavities of strictly convex. In the outside boundary of…

Analysis of PDEs · Mathematics 2017-09-04 Mishio Kawashita

We give a very short argument showing how the main identity from our earlier paper (Sogge and Zelditch, 2011) immediately leads to the best lower bound currently known (Colding and Minicozzi II, 2011) for the Hausdorff measure of nodal sets…

Analysis of PDEs · Mathematics 2013-07-26 Christopher D. Sogge , Steve Zelditch

It is proved that if $u_1,\ldots, u_n$ are vectors in ${\Bbb R}^k, k\le n, 1 \le p < \infty$ and $$r = ({1\over k} \sum ^n_1 |u_i|^p)^{1\over p}$$ then the volume of the symmetric convex body whose boundary functionals are $\pm u_1,\ldots,…

Metric Geometry · Mathematics 2016-09-06 Keith Ball , Alain Pajor

The existence of a smooth complete strictly locally convex hypersurface with prescribed scalar curvature and asymptotic boundary at infinity in $\mathbb{H}^{3}$ is proved under the assumption that there exists a strictly locally convex…

Differential Geometry · Mathematics 2020-12-08 Zhenan Sui

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

The convex body isoperimetric conjecture in the plane asserts that the least perimeter to enclose given area inside a unit disk is greater than inside any other convex set of area $\pi$. In this note we confirm two cases of the conjecture:…

Differential Geometry · Mathematics 2021-04-13 Bo-Hshiung Wang , Ye-Kai Wang

Let $N$ be a compact, orientable hyperbolic 3-manifold whose boundary is a connected totally geodesic surface of genus $2$. If $N$ has Heegaard genus at least $5$, then its volume is greater than $2V_{\rm oct}$, where $V_{\rm…

Geometric Topology · Mathematics 2025-12-19 Jason DeBlois , Peter B. Shalen

We study the slicing inequality for the surface area instead of volume. This is the question whether there exists a constant $\alpha_n$ depending (or not) on the dimension $n$ so that $$S(K)\leq\alpha_n|K|^{\frac{1}{n}}\max_{\xi\in…

Metric Geometry · Mathematics 2022-01-11 Silouanos Brazitikos , Dimitris-Marios Liakopoulos

It has been conjectured that the optimal canonical degree of a minimal surface of general type is 36, from a work in the 70's of Beauville who proved that 36 was an upper bound. The highest canonical degree known for the problem was 16 by…

Algebraic Geometry · Mathematics 2021-08-19 Sai-Kee Yeung

We prove that the highest density of non-overlapping translates of a given centrally symmetric convex domain relative to its outer parallel domain of given outer radius is attained by a lattice packing in the Euclidean plane. This…

Metric Geometry · Mathematics 2025-12-30 Károly Bezdek , Zsolt Lángi

Optimizing an implicational base of a closure system consists in turning this implicational base into an equivalent one with premises and conclusions as small as possible. This task is known to be hard in general but tractable for a number…

Combinatorics · Mathematics 2026-03-17 Anthony Meunier , Lhouari Nourine , Simon Vilmin

A 3-manifold is Haken if it contains a topologically essential surface. The Virtual Haken Conjecture says that every irreducible 3-manifold with infinite fundamental group has a finite cover which is Haken. Here, we discuss two interrelated…

Geometric Topology · Mathematics 2014-11-11 Nathan M Dunfield , William P Thurston

We show that the size of a minimal simplicial cover of a polytope $P$ is a lower bound for the size of a minimal triangulation of $P$, including ones with extra vertices. We then use this fact to study minimal triangulations of cubes, and…

Combinatorics · Mathematics 2007-05-23 Adam Bliss , Francis Edward Su
‹ Prev 1 8 9 10 Next ›