Related papers: Optimal Finite Homogeneous sphere approximation

The sphere packing problem is an old puzzle. We consider packings with m spheres in the unit cell (m-periodic packings). For the case m = 1 (lattice packings), Voronoi proved there are finitely many inequivalent local optima and presented…

We bound the number of incidences between points and spheres in finite vector spaces by bounding the sum of the number of points in the pairwise intersections of the spheres. We obtain new incidence bounds that are interesting when the…

In this paper, we extend the theory of simultaneous Diophantine approximation to infinite dimensions. Moreover, we discuss Dirichlet-type theorems in a very general framework and define what it means for such a theorem to be optimal. We…

This is a survey on best polynomial approximation on the unit sphere and the unit ball. The central problem is to describe the approximation behavior of a function by polynomials via smoothness of the function. A major effort is to identify…

The paper is devoted to perfect and almost perfect homogeneous polytopes in Euclidean spaces. We classified perfect and almost perfect polytopes among all regular polytopes and all semiregular polytopes excepting Archimedean solids and two…

We present simple examples of finite-dimensional connected homogeneous spaces (they are actually topological manifolds) with nonhomogeneous and nonrigid factors. In particular, we give an elementary solution of an old problem in general…

The set of points in a metric space is called an $s$-distance set if pairwise distances between these points admit only $s$ distinct values. Two-distance spherical sets with the set of scalar products $\{\alpha, -\alpha\}$,…

Let $X$ be a compact real algebraic set of dimension $n$. We prove that every Euclidean continuous map from $X$ into the unit $n$-sphere can be approximated by regulous map. This strengthens and generalizes previously known results.

Finding an exact maximum distance of two points in the given set is a fundamental computational problem which is solved in many applications. This paper presents a fast, simple to implement and robust algorithm for finding this maximum…

While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…

Radiative energy transfer between closely spaced bodies is known to be significantly larger than that predicted by classical radiative transfer because of tunneling due to evanescent waves. Theoretical analysis of near--field radiative…

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…

This article investigates the numerical approximation of shape optimization problems with PDE constraint on classes of convex domains. The convexity constraint provides a compactness property which implies well posedness of the problem.…

We show that for a suitable class of functions of finitely-many variables, the limit of integrals along slices of a high dimensional sphere is a Gaussian integral on a corresponding finite-codimension affine subspace in infinite dimensions.

We fully characterize orthogonal projections of infinite right circular (round) cones in real Hilbert spaces. Another interpretation is that, given two vectors in a real Hilbert space, we establish the optimal estimate on the angle between…

In this paper, we solve completely the $L^2\to L^r$ extension conjecture for the zero radius sphere over finite fields. We also obtain the sharp $L^p\to L^4$ extension estimate for non-zero radii spheres over finite fields, which improves…

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.…

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

In this paper I survey some recent results on finite determination, convergence, and approximation of formal mappings between real submanifolds in complex spaces. A number of conjectures are also given.

We prove weighted versions of the 2D Restriction Conjecture for the unit sphere in $\mathbb{R}^2$. Our results involve the weight functions $(1+|x|)^\alpha(1+|y|)^\beta$ and $(1+|x|+|y|)^\gamma$ with $\alpha,\beta,\gamma\geq 0$.