Related papers: On the existence and estimates of nested spherical…
We give an excess theorem for spherical 2-designs. This theorem is a dual version of the spectral excess theorem for graphs, which gives a characterization of distance-regular graphs, among regular graphs in terms of the eigenvalues and the…
We consider the problem of constructing optimal designs for model discrimination between competing regression models. Various new properties of optimal designs with respect to the popular $T$-optimality criterion are derived, which in many…
This paper explores a full generalization of the classical corner-vector method for constructing weighted spherical designs, which we call the {\it generalized corner-vector method}. First we establish a uniform upper bound for the degree…
Space-filling designs are popular choices for computer experiments. A sliced design is a design that can be partitioned into several subdesigns. We propose a new type of sliced space-filling design called sliced rotated sphere packing…
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.
This paper investigates the existence and properties of spherical $5$-designs of minimal type. We focus on two cases: tight spherical $5$-designs and antipodal spherical $4$-distance $5$-designs. We prove that a tight spherical $5$-design…
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…
In this paper, we compare two optimization algorithms using full Hessian and approximation Hessian to obtain numerical spherical designs through their variational characterization. Based on the obtained spherical design point sets, we…
In this paper, we mainly consider the problem of spherical distribution of 5 points, that is, how to configure 5 points on a sphere such that the mutual distance sum attains the maximum. It is conjectured that the sum of distances is…
This paper is concerned with the use of the stereographic projection to map the points of a design on the sphere in three dimensions onto a two-dimensional stereogram. Details of the projection and its attendant stereogram are given and the…
This short paper is concerned with the use of spherical t-designs as optimal designs for the spherical harmonic regression model in three dimensions over a range of specified criteria. The nature of the designs is explored and their…
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree polynomials on the Euclidean sphere or on the Hamming cube. We prove lower…
Erd\H{o}s and Fishburn studied the maximum number of points in the plane that span $k$ distances and classified these configurations, as an inverse problem of the Erd\H{o}s distinct distances problem. We consider the analogous problem for…
We develop a systematic framework for constructing spherical harmonics on the two-dimensional unit sphere as superpositions of Gaussian beams whose poles form well-separated point configurations. The distributional and analytic properties…
An arrangement of pseudocircles is a finite set of oriented closed Jordan curves each two of which cross each other in exactly two points. To describe the combinatorial structure of arrangements on closed orientable surfaces, in (Linhart,…
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 theory of arrangements of spheres. Consider a finite collection of codimension-$1$ subspheres in a positive-dimensional sphere. There are two posets associated with this collection: the poset of faces and the poset of…
For any positive integer $k>1$, we classify the antipodal point arrangements on the sphere $S^k$ up to an isomorphism, by associating a finite complete set of cycle invariants.
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…
We determine the topological complexity of unordered configuration spaces on almost all punctured surfaces (both orientable and non-orientable). We also give improved bounds for the topological complexity of unordered configuration spaces…