中文
相关论文

相关论文: Packing and covering with balls on Busemann surfac…

200 篇论文

If a convex body $K \subset \mathbb{R}^n$ is covered by the union of convex bodies $C_1, \ldots, C_N$, multiple subadditivity questions can be asked. Two classical results regard the subadditivity of the width (the smallest distance between…

度量几何 · 数学 2020-09-16 Alexey Balitskiy

In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings. We…

度量几何 · 数学 2019-11-07 Fernando Mário de Oliveira Filho , Frank Vallentin

We prove that closed surfaces of all topological types, except for the non-orientable odd-genus ones, can be minimally embedded in the Riemannian product of a sphere and a circle of arbitrary radius. We illustrate it by obtaining some…

微分几何 · 数学 2018-03-20 José M. Manzano , Julia Plehnert , Francisco Torralbo

We generate non-lattice packings of spheres in up to 22 dimensions using the geometrical constraint satisfaction algorithm RRR. Our aggregated data suggest that it is easy to double the density of Ball's lower bound, and more tentatively,…

度量几何 · 数学 2023-07-12 Veit Elser

G. Fejes T\'oth posed the following problem: Determine the infimum of the densities of the lattices of closed balls in $\bR^n$ such that each affine $k$-subspace $(0 \le k \le n-1)$ of $\bR^n$ intersects some ball of the lattice. We give a…

度量几何 · 数学 2016-12-06 E. Makai, , H. Martini

We are interested in the following problem of covering the plane by a sequence of congruent circular disks with a constraint on the distance between consecutive disks. Let $(\mathcal{D}_n)_{n \in \mathbb N}$ be a sequence of closed unit…

度量几何 · 数学 2020-06-19 Amitava Bhattacharya , Anupam Mondal

We give a new and elementary proof that the number of elastic collisions of a finite number of balls in the Euclidean space is finite. We show that if there are $n$ balls of equal masses and radii 1, and at the time of a collision between…

动力系统 · 数学 2018-04-13 Krzysztof Burdzy , Mauricio Duarte

In real space forms, Fraser and Schoen proved that a free-boundary minimal disk in a geodesic ball is totally geodesic. In this note, we consider free-boundary minimal surfaces $\Sigma$ (of any genus) in geodesic balls of complex space…

微分几何 · 数学 2020-11-17 Jesse Madnick

We study metric properties of convex bodies B and their polars B^o, where B is the convex hull of an orbit under the action of a compact group G. Examples include the Traveling Salesman Polytope in polyhedral combinatorics (G=S_n, the…

度量几何 · 数学 2007-05-23 Alexander Barvinok , Grigoriy Blekherman

In a projective plane $\Pi _{q}$ (not necessarily Desarguesian) of order $q,$ a point subset $S$ is saturating (or dense) if any point of $\Pi _{q}\setminus S$ is collinear with two points in$~S$. Using probabilistic methods, the following…

By a compact packing of the plane by discs, $P$, we mean a collection of closed discs in the plane with pairwise disjoint interior so that, for every disc $C\in P$, there exists a sequence of discs $D_{0},\ldots,D_{m-1}\in P$ so that each…

度量几何 · 数学 2023-05-02 Miek Messerschmidt

The $S^2 \times R$ geometry can be derived by the direct product of the spherical plane $\bS^2$ and the real line $\bR$. J. Z. Farkas has classified and given the complete list of the space groups of $S^2 \times R$. The $S^2 \times R$…

度量几何 · 数学 2012-06-05 Jenő Szirmai

The problem of packing Hamilton cycles in random and pseudorandom graphs has been studied extensively. In this paper, we look at the dual question of covering all edges of a graph by Hamilton cycles and prove that if a graph with maximum…

组合数学 · 数学 2011-11-15 Roman Glebov , Michael Krivelevich , Tibor Szabó

Algorithms for minimal enclosing ball problems are often geometric in nature. To highlight the metric ingredients underlying their efficiency, we focus here on a particularly simple geodesic-based method. A recent subgradient-based study…

最优化与控制 · 数学 2026-04-08 Ariel Goodwin , Adrian S. Lewis

We show that if $M^n$ is a properly immersed, two-sided, stable minimal hypersurface in $B^{n+1}_1(0)\setminus S$, where $S$ is closed with $\mathcal{H}^{n-2}(S)=0$, then $\text{dim}_{\mathcal{H}}\text{sing}(M)\leq n-7$, namely…

微分几何 · 数学 2026-05-07 Paul Minter , Zhengyi Xiao

A subset of the sphere is said short if it is contained in an open hemisphere. A short closed set which is geodesically convex is called a cap. The following theorem holds: 1. The minimal number of short closed sets covering the $n$-sphere…

几何拓扑 · 数学 2015-12-22 A. B. Németh

In this survey, we discuss volumetric and combinatorial results concerning (mostly finite) intersections or unions of balls (mostly of equal radii) in the $d$-dimensional real vector space, mostly equipped with the Euclidean norm. Our first…

度量几何 · 数学 2025-12-30 Károly Bezdek , Zsolt Lángi , Márton Naszódi

This is the sixth in a series of papers giving a proof of the Kepler conjecture, which asserts that the density of a packing of congruent spheres in three dimensions is never greater than $\pi/\sqrt{18}\approx 0.74048...$. This is the…

度量几何 · 数学 2007-05-23 Thomas C. Hales

A Bl-packing is a (branched) circle packing that ``properly covers'' the unit disc. We establish some fundamental properties of such packings. We give necessary and sufficient conditions for their existence, prove their uniqueness, and show…

复变函数 · 数学 2016-09-06 Tomasz Dubejko

Discs form a compact packing of the plane if they are interior disjoint and the graph which connects the center of mutually tangent discs is triangulated. There is only one compact packing by discs all of the same size, called hexagonal…

离散数学 · 计算机科学 2018-09-27 Thomas Fernique , Amir Hashemi , Olga Sizova