中文
相关论文

相关论文: Covering spheres with spheres

200 篇论文

Understanding how particles are arranged on the sphere is not only central to numerous physical, biological, and materials systems but also finds applications in mathematics and in analysis of geophysical and meteorological measurements. In…

软凝聚态物质 · 物理学 2019-03-06 Anže Lošdorfer Božič , Simon Čopar

In 3-dimensional Euclidean space, Scherk second surfaces are singly periodic embedded minimal surfaces with four planar ends. In this paper, we obtain a natural generalization of these minimal surfaces in any higher dimensional Euclidean…

微分几何 · 数学 2007-05-23 Frank Pacard

We improve upper bounds on sphere packing densities and sizes of spherical codes in high dimensions. In particular, we prove that the maximal sphere packing densities $\delta_n$ in $\mathbb{R}^n$ satisfy \[\delta_n\leq \frac{1+o(1)}{e}\cdot…

度量几何 · 数学 2024-07-16 Masoud Zargar

A cap of spherical radius $\alpha$ on a unit $d$-sphere $S$ is the set of points within spherical distance $\alpha$ from a given point on the sphere. Let $\mathcal F$ be a finite set of caps lying on $S$. We prove that if no hyperplane…

度量几何 · 数学 2022-08-10 Alexandr Polyanskii

We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…

This paper presents new lower bounds for the lattice covering densities of simplices by studying the Degree-Diameter Problem for abelian Cayley digraphs. In particular, it proves that the density of any lattice covering of a tetrahedron is…

度量几何 · 数学 2022-02-15 Miao Fu , Fei Xue , Chuanming Zong

A family of spherical caps of the 2-dimensional unit sphere $\mathbb{S}^2$ is called a totally separable packing in short, a TS-packing if any two spherical caps can be separated by a great circle which is disjoint from the interior of each…

度量几何 · 数学 2025-05-07 Károly Bezdek , Zsolt Lángi

We establish in this paper an upper bound on the second eigenvalue of n-dimensional spheres in the conformal class of the round sphere. This upper bound holds in all dimensions and is asymptotically sharp as the dimension increases.

谱理论 · 数学 2012-06-04 Romain Petrides

We improve by an exponential factor the best known asymptotic upper bound for the density of sets avoiding 1 in Euclidean space. This result is obtained by a combination of an analytic bound that is an analogue of Lovasz theta number and of…

组合数学 · 数学 2015-01-30 Christine Bachoc , Alberto Passuello , Alain Thiery

The sphere packing problem asks for the greatest density of a packing of congruent balls in Euclidean space. The current best upper bound in all sufficiently high dimensions is due to Kabatiansky and Levenshtein in 1978. We revisit their…

度量几何 · 数学 2015-01-14 Henry Cohn , Yufei Zhao

In "Dense Sphere Packings: A Blueprint for Formal Proofs" Hales proves that for every packing of unit spheres, the density in a ball of radius $r$ is at most $\pi/\sqrt{18}+c/r$ for some constant $c$. When $r$ tends to infinity, this gives…

度量几何 · 数学 2017-12-12 Nadja Scharf

We note that the recent polynomial proofs of the spherical and complex plank covering problems by Zhao and Ortega-Moreno give some general information on zeros of real and complex polynomials restricted to the unit sphere. As a corollary of…

度量几何 · 数学 2022-08-16 Alexey Glazyrin , Roman Karasev , Alexandr Polyanskii

Hard spheres are ubiquitous in condensed matter: they have been used as models for liquids, crystals, colloidal systems, granular systems, and powders. Packings of hard spheres are of even wider interest, as they are related to important…

无序系统与神经网络 · 物理学 2015-03-13 Giorgio Parisi , Francesco Zamponi

We prove a new lower bound for the almost 20 year old problem of determining the smallest possible size of an essential cover of the $n$-dimensional hypercube $\{\pm 1\}^n$, i.e. the smallest possible size of a collection of hyperplanes…

组合数学 · 数学 2025-04-30 Lisa Sauermann , Zixuan Xu

In this paper, we study the symplectic volume of the moduli space of polygons by using Witten's formula. We propose to use this volume as a measure for the flexibility of a polygon with fixed side-lengths. The main result of our is that…

辛几何 · 数学 2016-09-07 Vu The Khoi

A Delone set in $\mathbb{R}^n$ is a set such that (a) the distance between any two of its points is uniformly bounded below by a strictly positive constant and such that (b) the distance from any point to the remaining points in the set is…

数论 · 数学 2021-03-31 Faustin Adiceam , Ioannis Tsokanos

This is the eighth and final paper in a series 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…

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

We study a geometric property related to spherical hyperplane tessellations in $\mathbb{R}^{d}$. We first consider a fixed $x$ on the Euclidean sphere and tessellations with $M \gg d$ hyperplanes passing through the origin having normal…

概率论 · 数学 2021-09-01 Eric Lybrand , Anna Ma , Rayan Saab

Let $S$ be a set of $n$ points in $\mathbb{R}^3$, no three collinear and not all coplanar. If at most $n-k$ are coplanar and $n$ is sufficiently large, the total number of planes determined is at least $1 + k…

组合数学 · 数学 2010-10-12 George B. Purdy , Justin W. Smith

Tiet\"{a}v\"{a}inen's upper and lower bounds assert that for block-length-$n$ linear codes with dual distance $d$, the covering radius $R$ is at most $\frac{n}{2}-(\frac{1}{2}-o(1))\sqrt{dn}$ and typically at least…

信息论 · 计算机科学 2018-07-26 Louay Bazzi