中文
相关论文

相关论文: Exact value of Tammes problem for N=10

200 篇论文

Littlewood asked for the maximum number $N$ of congruent infinite cylinders that can be arranged in $\mathbb{R}^3$ so that every pair touches. We improve upon the proof of the second author that $N \leq 18$ to show that $N \leq 10$.…

组合数学 · 数学 2025-10-07 Travis Dillon , Junnosuke Koizumi , Sammy Luo

Let $\mathbb{S}^N\subset\mathbb{R}^{N+1}$, $N\ge 3$, be the unit sphere, and let $S_{\Theta}\subset\mathbb{S}^N$ be a geodesic ball with geodesic radius $\Theta\in(0,\pi)$. We study the bifurcation diagram…

偏微分方程分析 · 数学 2019-12-25 Atsushi Kosaka , Yasuhito Miyamoto

Given a sphere of any radius $r$ in an $n$-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average…

度量几何 · 数学 2018-05-22 Ilya Dumer

In the projective space $\mathrm{PG}(N,q)$ over the Galois field of order $q$, $N\ge3$, an iterative step-by-step construction of complete caps by adding a new point on every step is considered. It is proved that uncovered points are evenly…

We prove that the covering radius of an $N$-point subset $X_N$ of the unit sphere $S^d \subset R^{d+1}$ is bounded above by a power of the worst-case error for equal weight cubature $\frac{1}{N}\sum_{\mathbf{x} \in X_N}f(\mathbf{x}) \approx…

We consider packings of congruent circles on a square flat torus, i.e., periodic (w.r.t. a square lattice) planar circle packings, with the maximal circle radius. This problem is interesting due to a practical reason - the problem of "super…

度量几何 · 数学 2016-07-21 Oleg R. Musin , Anton V. Nikitenko

A celebrated result of Beck shows that for any set of $N$ points on $\mathbb{S}^d$ there always exists a spherical cap $B \subset \mathbb{S}^d$ such that number of points in the cap deviates from the expected value $\sigma(B) \cdot N$ by at…

经典分析与常微分方程 · 数学 2023-09-13 Dmitriy Bilyk , Michelle Mastrianni , Stefan Steinerberger

In the maximum coverage problem, we are given subsets $T_1, \ldots, T_m$ of a universe $[n]$ along with an integer $k$ and the objective is to find a subset $S \subseteq [m]$ of size $k$ that maximizes $C(S) := \Big|\bigcup_{i \in S}…

数据结构与算法 · 计算机科学 2021-05-04 Siddharth Barman , Omar Fawzi , Paul Fermé

In this paper, we show that the total area of two distinct surfaces with Gaussian curvature equal to 1, which are also conformal to the Euclidean unit disk with the same conformal factor on the boundary, must be at least 4{\pi}. In other…

偏微分方程分析 · 数学 2016-10-28 Changfeng Gui , Amir Moradifam

The thirteen spheres problem is asking if 13 equal size nonoverlapping spheres in three dimensions can touch another sphere of the same size. This problem was the subject of the famous discussion between Isaac Newton and David Gregory in…

度量几何 · 数学 2015-03-13 Oleg Musin , Alexey Tarasov

This note treats several problems for the fractional perimeter or $s$-perimeter on the sphere. The spherical fractional isoperimetric inequality is established. It turns out that the equality cases are exactly the spherical caps.…

泛函分析 · 数学 2020-12-01 Andreas Kreuml , Olaf Mordhorst

Spherical caps play a crucial role in establishing a criterion for the existence of solutions to the Yamabe problem on a compact Riemannian manifold with boundary, similar to the role played by the standard sphere in the problem on a closed…

偏微分方程分析 · 数学 2026-05-29 Mónica Clapp , Benedetta Pellacci , Angela Pistoia

We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…

度量几何 · 数学 2014-09-26 David de Laat , Fernando Mario de Oliveira Filho , Frank Vallentin

Recently, we enumerate up to isometry, all locally rigid circle packings on the unit sphere with number of circles N<12. This problem is equivalent to the enumeration of irreducible contact graphs. In this paper we show that by using the…

度量几何 · 数学 2015-04-21 Oleg R. Musin , Alexey S. Tarasov

Jung's theorem says that planar sets of diameter $1$ can be covered by a closed circular disk of radius $\frac 1{\sqrt3}$. In this paper we consider a fractional Jung-type problem for finite planar point-sets. Let $\mathcal{P}_n$ be the…

组合数学 · 数学 2025-12-03 András Bezdek , Owen Henderschedt

We prove the existence of an open set $\Omega\subset\mathbb{S}^2$ for which the first positive eigenvalue of the Laplacian with Neumann boundary condition exceeds that of the geodesic disk having the same area. This example holds for large…

偏微分方程分析 · 数学 2025-03-31 Dorin Bucur , Richard S. Laugesen , Eloi Martinet , Mickaël Nahon

Let $C(n)$ be the solution to the contact number problem, i.e., the maximum number of touching pairs among any packing of $n$ congruent spheres in $\mathbb{R}^3$. We prove the long conjectured values of $C(6)=12, C(7)=15$, and $C(8)=18$.…

度量几何 · 数学 2016-03-29 Samuel Reid

The Upper Bound Theorem for convex polytopes implies that the $p$-th Betti number of the \v{C}ech complex of any set of $N$ points in $\mathbb R^d$ and any radius satisfies $\beta_{p} = O(N^{m})$, with $m = \min \{ p+1, \lceil d/2 \rceil…

组合数学 · 数学 2023-10-24 Herbert Edelsbrunner , János Pach

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…

度量几何 · 数学 2020-08-12 Randall L. Rathbun

Let $M$ be a closed (compact with no boundary) spherical $CR$ manifold of dimension $2n+1$. Let $\widetilde{M}$ be the universal covering of $M.$ Let $% \Phi $ denote a $CR$ developing map {equation*} \Phi :\widetilde{M}\rightarrow S^{2n+1}…

微分几何 · 数学 2013-01-08 Jih-Hsin Cheng , Hung-Lin Chiu , Paul Yang