English
Related papers

Related papers: New asymptotic estimates for spherical designs

200 papers

We use geometric measure theory to introduce the notion of asymptotic cones associated with a singular subspace of a Riemannian manifold. This extends the classical notion of asymptotic directions usually defined on smooth submanifolds. We…

Differential Geometry · Mathematics 2015-01-13 Xiang Sun , Jean-Marie Morvan

In this paper we prove an asymptotic lower bound for the sphere packing density in dimensions divisible by four. This asymptotic lower bound improves on previous asymptotic bounds by a constant factor and improves not just lower bounds for…

Metric Geometry · Mathematics 2011-06-01 Stephanie Vance

Static spherically symmetric solutions to the Einstein-Euler equations with prescribed central densities are known to exist, be unique and smooth for reasonable equations of state. Some criteria are also available to decide whether…

General Relativity and Quantum Cosmology · Physics 2019-03-01 Lars Andersson , Annegret Y. Burtscher

The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and Vallentin developed a method to find upper bounds for the kissing…

Optimization and Control · Mathematics 2019-11-07 Hans D. Mittelmann , Frank Vallentin

For positive integers $n \ge s > r$, a \emph{Tur\'{a}n $(n,s,r)$-system} is an $n$-vertex $r$-graph in which every set of $s$ vertices contains at least one edge. Let $T(n,s,r)$ denote the the minimum size of a Tur\'{a}n $(n,s,r)$-system.…

Combinatorics · Mathematics 2025-02-04 Xizhi Liu , Oleg Pikhurko

We study the asymptotic behaviour of both spherical $t$-designs and random uniform designs as the set of sampling points in non-parametric regression with spherical regressors of arbitrary dimension. We show that the corresponding…

Statistics Theory · Mathematics 2026-05-05 Martin Kroll

We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.

Combinatorics · Mathematics 2025-10-06 Ritesh Goenka , Kenneth Moore , Ethan Patrick White

On the circle of radius $R$ centred at the origin, consider a ``thin'' sector about the fixed line $y = \alpha x$ with edges given by the lines $y = (\alpha \pm \epsilon) x$, where $\epsilon = \epsilon_R \rightarrow 0$ as $ R \to \infty $.…

Number Theory · Mathematics 2025-11-17 Ezra Waxman , Nadav Yesha

In this article we investigate the $N$-point min-max and the max-min polarization problems on the sphere for a large class of potentials in $\mathbb{R}^n$. We derive universal lower and upper bounds on the polarization of spherical designs…

Combinatorics · Mathematics 2022-07-20 Peter Boyvalenkov , Peter Dragnev , Douglas Hardin , Edward Saff , Maya Stoyanova

In this paper we show that the spherical cap discrepancy of the point set given by centers of pixels in the HEALPix tessellation (short for Hierarchical, Equal Area and iso-Latitude Pixelation) of unit $2$-sphere is lower and upper bounded…

Numerical Analysis · Mathematics 2022-03-16 Damir Ferizović , Julian Hofstadler , Michelle Mastrianni

We derive an asymptotic lower bound on the Shannon entropy $H$ of sums of $N$ arbitrary iid discrete random variables. The derived bound $H \geq \frac{r(X)}{2}\log(N) + {\it cst}$ is given in terms of the incommensurability rank $r(X)$ of…

Information Theory · Computer Science 2025-08-08 Riccardo Castellano , Pavel Sekatski

In this paper analyzes \textit{The Erd\H{o}s-Straus conjecture} asserts that $f$$(n)$ $>$ 0 for every $n$ $\geq$ 2, where $f(n)$ indicates the number of solutions to the Diophantine Equation…

General Mathematics · Mathematics 2016-09-02 Elias Rios

For each n greater than 7 we explicitly construct a sequence of Stein manifolds diffeomorphic to complex affine space of dimension n so that there is no algorithm to tell us in general whether a given such Stein manifold is symplectomorphic…

Symplectic Geometry · Mathematics 2011-09-22 Mark McLean

In this note, we establish an asymptotic formula for the number of rational points of bounded height on the singular cubic surface $$ x_0(x_1^2 + x_2^2)=x_3^3 $$ with a power-saving error term, which verifies the Manin-Peyre conjectures for…

Number Theory · Mathematics 2018-12-13 Régis de la Bretèche , Kevin Destagnol , Jianya Liu , Jie Wu , Yongqiang Zhao

We give an optimal bound for the remainder when counting the number of rational points on the $n$-dimensional sphere with bounded denominator for any $n\geq 2$.

Number Theory · Mathematics 2024-04-09 Dubi Kelmer

We extend the concepts of sum-free sets and Sidon-sets of combinatorial number theory with the aim to provide explicit constructions for spherical designs. We call a subset $S$ of the (additive) abelian group $G$ {\it $t$-free} if for all…

Combinatorics · Mathematics 2015-12-10 Béla Bajnok

Let $C_{i}$ ($\,i=1,\ldots ,N\,$) be the $i$-th open spherical cap of angular radius $r$ and let $M_{i}$ be its center under the condition that none of the spherical caps contains the center of another one in its interior. We consider the…

Metric Geometry · Mathematics 2015-09-15 Teruhisa Sugimoto , Masaharu Tanemura

Let G, a subset of O(4), act isometrically on the 3-sphere. In this article we calculate a lower bound for the diameter of the quotient spaces $S^3/G$. We find it to be ${1/2}\arccos(\frac{\tan(\frac{3 \pi}{10})}{\sqrt3})$, which is exactly…

Differential Geometry · Mathematics 2007-05-23 W. Dunbar , S. Greenwald , J. McGowan , C. Searle

The problem of uniformly placing N points onto a sphere finds applications in many areas. For example, points on the sphere correspond to unit quaternions as well as to the group of rotations SO(3) and the online version of generating…

Computational Geometry · Computer Science 2020-05-14 Paul C. Bell , Igor Potapov

We consider the fragmentation at nodes of the L\'{e}vy continuous random tree introduced in a previous paper. In this framework we compute the asymptotic for the number of small fragments at time $\theta$. This limit is increasing in…

Probability · Mathematics 2007-05-23 Romain Abraham , Jean-François Delmas