Related papers: The bounds of rigid sphere design

In this paper we prove the conjecture of Korevaar and Meyers: for each $N\ge c_dt^d$ there exists a spherical $t$-design in the sphere $S^d$ consisting of $N$ points, where $c_d$ is a constant depending only on $d$.

For each $N\ge C_dt^d$ we prove the existence of a well separated spherical $t$-design in the sphere $S^d$ consisting of $N$ points, where $C_d$ is a constant depending only on $d$.

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…

Given a finite subset of a sphere or projective space, known as a design, we can compute the strength and angle set of that design. When the strength and angle set meet certain bounds, the design is called tight. Hoggar sought to prove…

For each N>=c_d*n^{2d*(d+1)/(d+2)} we prove the existence of a spherical n-design on S^d consisting of N points, where c_d is a constant depending only on $d$.

In this paper, we study conditions under which a finite subset $Z$ of the unit sphere $S^{d-1}\subset \mathbb{R}^{d}$ becomes a spherical $t$-design, when $Z$ is constructed by the following procedure: starting from a finite set of…

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…

We consider a class of overdetermined problems in rotationally symmetric spaces, which reduce to the classical Serrin's overdetermined problem in the case of the Euclidean space. We prove some general integral identities for rotationally…

Spherical $t$-designs are finite point sets on the unit sphere that enable exact integration of polynomials of degree at most $t$ via equal-weight quadrature. This concept has recently been extended to spherical $t$-design curves by the use…

Spherical t-designs are Chebyshev-type averaging sets on the d-sphere S^d which are exact for polynomials of degree at most t. This concept was introduced in 1977 by Delsarte, Goethals, and Seidel, who also found the minimum possible size…

We consider the problem of finding an inductive construction, based on vertex splitting, of triangulated spheres with a fixed number of additional edges (braces). We show that for any positive integer $b$ there is such an inductive…

Let X be a tight t-design of dimension n for one of the open cases t=5 or t=7. An investigation of the lattice generated by X using arithmetic theory of quadratic forms allows to exclude infinitely many values for n.

This paper investigates the existence of $m$-stiff configurations in the unit sphere $S^{d-1}$, which are spherical $(2m-1)$-designs that lie on $m$ parallel hyperplanes. We establish two non-existence results: (1) for each fixed integer $m…

We effectively bound T-singularities on non-rational projective surfaces with an arbitrary amount of T-singularities and ample canonical class. This fully generalizes the previous work for the case of one singularity, and illustrates the…

This paper provides triangular spherical designs for the complex unit sphere $\Omega^d$ by exploiting the natural correspondence between the complex unit sphere in $d$ dimensions and the real unit sphere in $2d-1$. The existence of…

Spherical $t$-designs on $\mathbb{S}^{d}\subset\mathbb{R}^{d+1}$ provide $N$ nodes for an equal weight numerical integration rule which is exact for all spherical polynomials of degree at most $t$. This paper considers the generation of…

Determining the number of (complex) realisations of a rigid graph for a specific choice of edge lengths is a fundamental problem in discrete geometry. In this article we provide two new tools for determining realisation numbers in arbitrary…

In this paper, we provide a criterion for determining whether multiple shells support a $t$-design. We construct as a corollary an infinite series of $2$-designs using power residue codes.

Recall that combinatorial $2s$-designs admit a classical lower bound $b \ge \binom{v}{s}$ on their number of blocks, and that a design meeting this bound is called tight. A long-standing result of Bannai is that there exist only finitely…

In analogy to classical spherical t-design points, we introduce the concept of t-design curves on the sphere. This means that the line integral along a t-design curve integrates polynomials of degree t exactly. For low degrees we construct…