Related papers: Construction of spherical cubature formulas using …
This work describes a new version of the Fast Multipole Method for summing pairwise particle interactions that arise from discretizing integral transforms and convolutions on the sphere. The kernel approximations use barycentric Lagrange…
Realistic 3D-conformations of protein structures can be embedded in a cubic lattice using exclusively integer numbers, additions, subtractions and boolean operations.
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…
We construct spherical harmonics for fuzzy spheres of even and odd dimensions, generalizing the correspondence between finite matrix algebras and fuzzy two-spheres. The finite matrix algebras associated with the various fuzzy spheres have a…
We consider quadrature formulas based on interpolation using the basis functions $1/(1+t_kx)$ $(k=1,2,3,\ldots)$ on $[-1,1]$, where $t_k$ are parameters on the interval $(-1,1)$. We investigate two types of quadratures: quadrature formulas…
Given a combinatorial $(d-1)$-sphere $S$, to construct a combinatorial $d$-sphere $S^{\hspace{.2mm}\prime}$ containing $S$, one usually needs some more vertices. Here we consider the question whether we can do one such construction without…
We propose a new class of space-filling designs called rotated sphere packing designs for computer experiments. The approach starts from the asymptotically optimal positioning of identical balls that covers the unit cube. Properly scaled,…
We develop the basic formulae of hyperspherical trigonometry in multidimensional Euclidean space, using multidimensional vector products, and their conversion to identities for elliptic functions. We show that the basic addition formulae…
A fully implementable filtered polynomial approximation on spherical shells is considered. The method proposed is a quadrature-based version of a filtered polynomial approximation. The radial direction and the angular direction of the…
Many of the classic problems of coding theory are highly symmetric, which makes it easy to derive sphere-packing upper bounds and sphere-covering lower bounds on the size of codes. We discuss the generalizations of sphere-packing and…
Using equivariant localization formulas we give a formula for conformal blocks at level one on the sphere as suitable polynomials. Using this presentation we give a generating set in the space of conformal blocks at any level if the marked…
We explain in some detail the geometric structure of spheres in any dimension. Our approach may be helpful for other homogeneous spaces (with other signatures) such as the de Sitter and anti-de Sitter spaces. We apply the procedure to the…
Inspired by the linear programming method developed by Cohn and Elkies (Ann. Math. 157(2): 689-714, 2003), we introduce a new linear programming method to solve the sphere packing problem. More concretely, we consider sequences of auxiliary…
We characterize the generating function of the number of representations described in the title in terms of the theory of modular forms. Appealing to this characterization we obtain explicit formulas for the representation numbers as…
We propose, analyze, and implement interpolatory approximations and Filon-type cubature for efficient and accurate evaluation of a class of wideband generalized Fourier integrals on the sphere. The analysis includes derivation of (i)…
We introduce a new method of symmetrization of mappings on the $n$-sphere ($n\geq 2$). They are applied to estimate solutions of quasilinear elliptic partial differential equations of $p$-Laplacian type, with combinations of Dirac measures…
We find out for which $t$ shells of selfdual lattices and of theirs shadows are spherical $t$-designs. The method uses theta series of lattices, which are modular forms. We analyse fully cubic and Witt lattices, as well as all selfdual…
In this note, we construct non-lattice sphere packings in dimensions $19$, $20$, $21$, $23$, $44$, $45$, and $47$, demonstrating record densities that surpass all previously documented results in these dimensions. The construction involves…
Continuing the investigations of Harborth (1974) and the author (2002) we study the following two rather basic problems on sphere packings. Recall that the contact graph of an arbitrary finite packing of unit balls (i.e., of an arbitrary…
A rigidity theory is developed for bar-joint frameworks in $\mathbb{R}^{d+1}$ whose vertices are constrained to lie on concentric $d$-spheres with independently variable radii. In particular, combinatorial characterisations are established…