Related papers: Constructions of Spherical 3-Designs

A set in $\mathbb R^d$ is called almost-equidistant if for any three distinct points in the set, some two are at unit distance apart. First, we give a short proof of the result of Bezdek and L\'angi claiming that an almost-equidistant set…

Sphere packing, Hilbert's eighteenth problem, asks for the densest arrangement of congruent spheres in n-dimensional Euclidean space. Although relevant to areas such as cryptography, crystallography, and medical imaging, the problem remains…

We derive universal lower and upper bounds for max-min and min-max problems (also known as polarization) for the potential of spherical $(k,k)$-designs and provide certain examples, including unit-norm tight frames, that attain these…

In this paper we study convex subcomplexes of spherical buildings. We pay special attention to fixed point sets of type-preserving isometries of spherical buildings. This sets are also convex subcomplexes of the natural polyhedral structure…

A reformulation of the three circles theorem of Johnson with distance coordinates to the vertices of a triangle is explicitly represented in a polynomial system and solved by symbolic computation. A similar polynomial system in distance…

We want to introduce a construction of spherical designs from finite graphs with the theory of crystal lattice. We start from a finite graph, and we consider standard realization of the crystal lattices as the maximal Abelian covering of…

A set of points $S$ in $d$-dimensional Euclidean space $\mathbb{R}^d$ is called a 2-distance set if the set of pairwise distances between the points has cardinality two. The 2-distance set is called spherical if its points lie on the unit…

Suppose that $\theta_1,\theta_2,\dots,\theta_n$ are positive numbers and $n\ge 3$. Does there exist a sphere with a spherical metric with $n$ conical singularities of angles $2\pi\theta_1,2\pi\theta_2,\dots,2\pi\theta_n$? A sufficient…

Let T_0=(A_0,..,A_d) be a d-simplex, G_0 its centroid, S its circumsphere, O the center of S. Let (B_i) be the points where S intersects the lines (G_0A_i), T_1 the d-simplex (B_1,..,B_d), and G_1 its centroid. By iterating this…

The colourful simplicial depth problem in dimension d is to find a configuration of (d+1) sets of (d+1) points such that the origin is contained in the convex hull of each set (colour) but contained in a minimal number of colourful…

If a (weighted) spherical design is defined as an integration (cubature) rule for a unitarily invariant space P of polynomials (on the sphere), then any unitary image of it is also such a spherical design. It therefore follows that such…

This paper establishes a rigorous geometrical framework for spherical origami, origami using spherical sheets based on spherical geometry. Two settings are treated: origami restricted to the unit sphere ($\mathbb{S}^2$), and…

We construct, for every even dimensional sphere $S^n$, $n >1$, and every odd integer $k$, a homogeneous polynomial map $f: S^{n}\to S^{n}$ of Brouwer degree $k$ and algebraic degree $2|k|-1$.

We derive upper bounds for the potential energy of spherical designs of cardinality close to the Delsarte-Goethals-Seidel bound. These bounds are obtained by linear programming with the use of the Hermite interpolating polynomial of the…

This paper studies the minimal number of vertices $\lambda(n,d)$ required in a triangulation of the $n$-sphere to admit a simplicial map to the boundary of a $(n+1)$-simplex with a given degree $d$. We establish upper bounds for…

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…

In 1989, Erd\H{o}s conjectured that for a sufficiently large $n$ it is impossible to place $n$ points in general position in a plane such that for every $1\le i \le n-1$ there is a distance that occurs exactly $i$ times. For small $n$ this…

We present a new systematic approach to constructing spherical codes in dimensions $2^k$, based on Hopf foliations. Using the fact that a sphere $S^{2n-1}$ is foliated by manifolds $S_{\cos\eta}^{n-1} \times S_{\sin\eta}^{n-1}$,…

Quasipatterns (two-dimensional patterns that are quasiperiodic in any spatial direction) remain one of the outstanding problems of pattern formation. As with problems involving quasiperiodicity, there is a small divisor problem. In this…

The dispersion of a point set $P\subset[0,1]^d$ is the volume of the largest box with sides parallel to the coordinate axes, which does not intersect $P$. Here, we show a construction of low-dispersion point sets, which can be deduced from…