English
Related papers

Related papers: Essential covers of the hypercube require many hyp…

200 papers

Theoretical background is provided towards the mathematical foundation of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the…

Computational Geometry · Computer Science 2024-02-13 Michael N. Vrahatis

In this paper, we address a particular variation of the Tur\'an problem for the hypercube. Alon, Krech and Szab\'o (2007) asked "In an n-dimensional hypercube, Qn, and for l < d < n, what is the size of a smallest set, S, of Q_l's so that…

Combinatorics · Mathematics 2011-10-04 Brendon Stanton , Lale Özkahya

In the packing-constrained point covering problem, PC^2, one seeks configurations of points in the plane that cannot all be covered by a packing arrangement of unit disks. We consider in particular the problem of finding the minimum number…

Metric Geometry · Mathematics 2011-01-19 Veit Elser

The Generalized Lax Conjecture asks whether every hyperbolicity cone is a section of a semidefinite cone of sufficiently high dimension. We prove that the space of hyperbolicity cones of hyperbolic polynomials of degree $d$ in $n$ variables…

Optimization and Control · Mathematics 2018-01-15 Prasad Raghavendra , Nick Ryder , Nikhil Srivastava , Benjamin Weitz

We prove rigidity for hypersurfaces with boundary in the unit $(n+1)$-sphere with scalar curvature bounded below by $n(n-1)$. Under appropriate boundary conditions, the hypersurfaces are shown to be part of the equatorial spheres. The lower…

Differential Geometry · Mathematics 2016-12-28 Lan-Hsuan Huang , Damin Wu

The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regev (2003) proved that the problem is NP-hard to approximate within a factor $2 - \epsilon$, assuming the Unique…

Computational Complexity · Computer Science 2015-11-30 Abbas Bazzi , Samuel Fiorini , Sebastian Pokutta , Ola Svensson

We provide upper and lower bounds on the least-perimeter way to enclose and separate n regions of equal area in the plane. Along the way, inside the hexagonal honeycomb, we provide minimizers for each n .

Metric Geometry · Mathematics 2007-05-23 Aladar Heppes , Frank Morgan

Consider the hyperplanes at a fixed distance $t$ from the center of the hypercube $[0,1]^d$. Significant attention has been given to determining the hyperplanes $H$ among these such that the $(d-1)$-dimensional volume of $H\cap[0,1]^d$ is…

Metric Geometry · Mathematics 2024-06-25 Lionel Pournin

We prove that every complete non-compact manifold of finite volume contains a (possibly non-compact) minimal hypersurface of finite volume. The main tool is the following result of independent interest: if a region $U$ can be swept out by a…

Differential Geometry · Mathematics 2019-08-27 Gregory R. Chambers , Yevgeny Liokumovich

For closed odd-dimensional manifolds with sectional curvature less or equal than -1, we define the minimal surface entropy that counts the number of surface subgroups. It attains the minimum if and only if the metric is hyperbolic.…

Differential Geometry · Mathematics 2022-09-28 Ruojing Jiang

We establish new strong lower bounds on the (subnormal) subgroup growth of a large class of groups. This includes the fundamental groups of all finite-volume hyperbolic 3-manifolds and all (free non-abelian)-by-cyclic groups. The lower…

Group Theory · Mathematics 2014-02-26 Marc Lackenby

In this paper we investigate the distances between Dehn fillings on a hyperbolic 3-manifold that yield 3-manifolds containing essential small surfaces including non-orientable surfaces. Especially we study the situations where one filling…

Geometric Topology · Mathematics 2007-05-23 Sangyop Lee , Seungsang Oh , Masakazu Teragaito

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

We give a review of results on the minimum convex cover and maximum hidden set problems. In addition, we give some new results. First we show that it is NP-hard to determine whether a polygon has the same convex cover number as its hidden…

Computational Geometry · Computer Science 2026-04-30 Reilly Browne

Let $\mu(\varepsilon)$ be the minimum number of cubes of side $\varepsilon$ needed to cover the unit three-torus $[\mathbb{R}/\mathbb{Z}]^3$. We prove new lower and upper bounds for $\mu(\varepsilon)$ and find the exact value for all…

Combinatorics · Mathematics 2022-11-08 Ilya Bogdanov , Oleg Grigoryan , Maksim Zhukovskii

Let $H_n$ be the minimal number of smaller homothetic copies of an $n$-dimensional convex body required to cover the whole body. Equivalently, $H_n$ can be defined via illumination of the boundary of a convex body by external light sources.…

Metric Geometry · Mathematics 2020-10-01 A. Prymak , V. Shepelska

Consider the algebraic function $\Phi_{g,n}$ that assigns to a general $g$-dimensional abelian variety an $n$-torsion point. A question first posed by Kronecker and Klein asks: What is the minimal $d$ such that, after a rational change of…

Algebraic Geometry · Mathematics 2023-06-22 Benson Farb , Mark Kisin , Jesse Wolfson

Covering systems were introduced by Erd\H{o}s in 1950. In the same article where he introduced them, he asked if the minimum modulus of a covering system with distinct moduli is bounded. In 2015, Hough answered affirmatively this long…

Number Theory · Mathematics 2023-08-25 Jonah Klein , Dimitris Koukoulopoulos , Simon Lemieux

Let $M$ be an $n$-dimensional smooth oriented complete embedded minimal hypersurface in $\mathbb{R}^{n+1}$ with Euclidean volume growth. We show that if the image under the Gauss map of $M$ avoids some neighborhood of a half-equator, then…

Differential Geometry · Mathematics 2022-05-17 Qi Ding

This paper views the honeycomb conjecture and the Kepler problem essentially as extreme value problems and solves them by partitioning 2-space and 3-space into building blocks and determining those blocks that have the universal extreme…

General Mathematics · Mathematics 2009-07-27 Fu-Gao Song , Francis Austin