English
Related papers

Related papers: Spherical sets avoiding a prescribed set of angles

200 papers

We study the convergence rate of a hierarchy of upper bounds for polynomial minimization problems, proposed by Lasserre [SIAM J. Optim. 21(3) (2011), pp. 864-885], for the special case when the feasible set is the unit (hyper)sphere. The…

Optimization and Control · Mathematics 2019-04-19 Etienne de Klerk , Monique Laurent

Using graph-theoretic methods we give a new proof that for all sufficiently large $n$, there exist sphere packings in $\R^n$ of density at least $cn2^{-n}$, exceeding the classical Minkowski bound by a factor linear in $n$. This matches up…

Combinatorics · Mathematics 2007-05-23 Michael Krivelevich , Simon Litsyn , Alexander Vardy

The Tomas-Stein inequality for a compact subset $\Gamma$ of the sphere $S^d$ states that the mapping $f\mapsto \widehat{f\sigma}$ is bounded from $L^2(\Gamma,\sigma)$ to $L^{2+4/d}(\R^{d+1})$. Then conditional on a strict comparison between…

Classical Analysis and ODEs · Mathematics 2026-05-26 Shuanglin Shao , Ming Wang

Although the highest redshift QSOs (z>6.1) are embedded in a significantly neutral background universe (mass-averaged neutral hydrogen fraction >1%) as suggested by the Gunn-Peterson absorption troughs in their spectra, the intergalactic…

Astrophysics · Physics 2009-11-10 Qingjuan Yu

We quantify the density of rational points in the unit sphere $S^n$, proving analogues of the classical theorems on the embedding of $\q^n$ into $\r^n$. Specifically, we prove a Dirichlet theorem stating that every point $\alpha \in S^n$ is…

Number Theory · Mathematics 2013-05-28 Dmitry Kleinbock , Keith Merrill

We study the problem of maximizing the $k$-th eigenvalue functional over the class of absolutely continuous measures on a closed Riemannian manifold of dimension $m\geq 3$. For dimensions $3 \leq m \leq 6$, we generalize the work of…

Spectral Theory · Mathematics 2025-07-15 Denis Vinokurov

We provide a refinement of the sphere-packing bound for constant composition codes over asymmetric discrete memoryless channels that improves the pre-factor in front of the exponential term. The order of our pre-factor is…

Information Theory · Computer Science 2012-11-29 Yucel Altug , Aaron B. Wagner

In this paper, we prove the existence of a spherical $t$-design formed by adding extra points to an arbitrarily given point set on the sphere and, subsequently, deduce the existence of nested spherical designs. Estimates on the number of…

Functional Analysis · Mathematics 2024-05-20 Ruigang Zheng , Xiaosheng Zhuang

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

Cameron and Erd\H{o}s asked whether the number of \emph{maximal} sum-free sets in $\{1, \dots , n\}$ is much smaller than the number of sum-free sets. In the same paper they gave a lower bound of $2^{\lfloor n/4 \rfloor }$ for the number of…

Combinatorics · Mathematics 2018-05-14 József Balogh , Hong Liu , Maryam Sharifzadeh , Andrew Treglown

We prove a limit theorem for the the maximal interpoint distance (also called the diameter) for a sample of n i.i.d. points in the unit ball of dimension 2 or more. The exact form of the limit distribution and the required normalisation are…

Probability · Mathematics 2007-05-23 Michael Mayer , Ilya Molchanov

We show several variants of concentration inequalities on the sphere stated as subgaussian estimates with optimal constants. For a Lipschitz function, we give one-sided and two-sided bounds for deviation from the median as well as from the…

Probability · Mathematics 2026-04-02 Guillaume Aubrun , Justin Jenkinson , Stanislaw J. Szarek

Recently, a vector version of Witsenhausen's counterexample was considered and it was shown that in that limit of infinite vector length, certain quantization-based control strategies are provably within a constant factor of the optimal…

Information Theory · Computer Science 2016-11-17 Pulkit Grover , Se Yong Park , Anant Sahai

In 1995, D. Jerison and C. Kenig in \cite{JK-1995} considered the the inhomogeneous Dirichlet problem $\Delta u= f$ on $\Omega$, $u=0$ on $\partial\Omega$ in Lipschitz domains. One of their main results shows that the $W^{1,p}$ estimate…

Analysis of PDEs · Mathematics 2025-02-14 Jun Geng

Many physical problems such as Allen-Cahn flows have natural maximum principles which yield strong point-wise control of the physical solutions in terms of the boundary data, the initial conditions and the operator coefficients.…

Numerical Analysis · Mathematics 2021-07-21 Dong Li

We obtain an upper bound to the packing density of regular tetrahedra. The bound is obtained by showing the existence, in any packing of regular tetrahedra, of a set of disjoint spheres centered on tetrahedron edges, so that each sphere is…

Metric Geometry · Mathematics 2010-11-23 Simon Gravel , Veit Elser , Yoav Kallus

Motivated by intuitions from projective algebraic geometry, we provide a novel construction of subsets of the $d$-dimensional grid $[n]^d$ of size $n - o(n)$ with no $d + 2$ points on a sphere or a hyperplane. For $d = 2$, this improves the…

Combinatorics · Mathematics 2025-06-24 Zichao Dong , Zijian Xu

In Ahlfors' covering surface theory, it is well known that there exists a positive constant $h$ such that for any nonconstant holomorphic mapping $f:% \bar{\Delta}\to S,$ if $f(\Delta)\cap \{0,1,\infty \}=\emptyset ,$ then% A(f,\Delta)\leq…

Complex Variables · Mathematics 2009-03-24 Guang Yuan Zhang

A family of sets is said to be \emph{intersecting} if any two sets in the family have nonempty intersection. In 1973, Erd\H{o}s raised the problem of determining the maximum possible size of a union of $r$ different intersecting families of…

Combinatorics · Mathematics 2019-10-09 David Ellis , Noam Lifshitz

We show that the maximum number of triples on $n$~points, if no three triples span at most five points, is $(1\pm o(1))n^2/5$. More generally, let $f^{(r)}(n;k,s)$ be the maximum number of edges of an $r$-uniform hypergraph on $n$~vertices…

Combinatorics · Mathematics 2018-12-05 Stefan Glock