English
Related papers

Related papers: Existence and nonexistence of spherical $5$-design…

200 papers

A finite subset $X$ on the unit sphere $\mathbb{S}^{d-1}$ is called an $s$-distance set with strength $t$ if its angle set $A(X):=\{\langle \mathbf{x},\mathbf{y}\rangle : \mathbf{x},\mathbf{y}\in X,\mathbf{x}\neq\mathbf{y} \}$ has size $s$,…

Combinatorics · Mathematics 2020-07-31 Zhiqiang Xu , Zili Xu , Wei-Hsuan Yu

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…

Combinatorics · Mathematics 2011-10-18 Peter Dukes , Jesse Short-Gershman

A spherical $t$-design is a finite subset $X$ of the unit sphere such that every polynomial of degree at most $t$ has the same average over $X$ as it does over the entire sphere. Determining the minimum possible size of spherical designs,…

Statistics Theory · Mathematics 2026-01-13 Travis Dillon

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…

Combinatorics · Mathematics 2024-04-25 Bela Bajnok

A finite subset $Y$ on the unit sphere $S^{n-1} \subseteq \mathbb{R}^n$ is called a spherical design of harmonic index $t$, if the following condition is satisfied: $\sum_{\mathbf{x}\in Y}f(\mathbf{x})=0$ for all real homogeneous harmonic…

Combinatorics · Mathematics 2015-07-22 Yan Zhu , Eiichi Bannai , Etsuko Bannai , Kyoung-Tark Kim , Wei-Hsuan Yu

This paper develops an explicit and implementable framework for constructing spherical designs by lifting point sets from tight fusion frames. By combining existing ingredients, we obtain, in every dimension, explicit spherical $5$-designs…

Combinatorics · Mathematics 2026-02-24 Ryutaro Misawa

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…

Numerical Analysis · Mathematics 2017-09-07 Robert S. Womersley

An equiangular tight frame (ETF) is a type of optimal packing of lines in a real or complex Hilbert space. In the complex case, the existence of an ETF of a given size remains an open problem in many cases. In this paper, we observe that…

Functional Analysis · Mathematics 2018-03-21 Matthew Fickus , John Jasper

We give some new explicit examples of putatively optimal projective spherical designs. i.e., ones for which there is numerical evidence that they are of minimal size. These form continuous families, and so have little apparent symmetry in…

Combinatorics · Mathematics 2025-03-20 Alex Elzenaar , Shayne Waldron

A group-theoretical approach to the construction of quasiperiodic tilings of a Euclidean plane, possessing five-fold symmetry, is applied. Of the infinitely many of variants of quasiperiodic partitions of the plane, possessing the dihedral…

General Mathematics · Mathematics 2019-08-08 Alexander S. Prokhoda

We use linear programming techniques to find points of absolute minimum over the unit sphere $S^{d}$ in $\mathbb R^{d+1}$ of the total potential of a point configuration $\omega_N\subset S^{d}$ which is a spherical $(2m-1)$-design contained…

Combinatorics · Mathematics 2022-12-12 Sergiy Borodachov

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…

Functional Analysis · Mathematics 2024-05-20 Ruigang Zheng , Xiaosheng Zhuang

A finite set $X \seq \RR^n$ with a weight function $w : X \longrightarrow \RR_{>0}$ is called \emph{Euclidean $t$-design} in $\RR^n$ (supported by $p$ concentric spheres) if the following condition holds: \[ \sum_{i=1}^p…

Combinatorics · Mathematics 2010-12-10 Djoko Suprijanto

Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…

Geometric Topology · Mathematics 2018-10-24 Benjamin A. Burton , Basudeb Datta , Nitin Singh , Jonathan Spreer

In this article we prove that integral lattices with minimum <= 7 (or <= 9) whose set of minimal vectors form spherical 9-designs (or 11-designs respectively) are extremal, even and unimodular. We furthermore show that there does not exist…

Number Theory · Mathematics 2013-06-20 Elisabeth Nossek

A spherical $t$-design is a set of points on the sphere that are nodes of a positive equal weight quadrature rule having algebraic accuracy $t$ for all spherical polynomials with degrees $\le t$. Spherical $t$-designs have many…

Numerical Analysis · Mathematics 2015-02-13 Yang Zhou , Xiaojun Chen

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…

Combinatorics · Mathematics 2025-07-31 Eiichi Bannai , Hirotake Kurihara , Hiroshi Nozaki

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…

Combinatorics · Mathematics 2025-03-05 Martin Ehler

An equiangular tight frame (ETF) is a set of equal norm vectors in a Euclidean space whose coherence is as small as possible, equaling the Welch bound. Also known as Welch-bound-equality sequences, such frames arise in various applications,…

Functional Analysis · Mathematics 2016-06-24 Matthew Fickus , Dustin G. Mixon , John Jasper

Inspired by a recently formulated conjecture by Bannai et al. we investigate spherical codes which admit exactly three different distances and are spherical 5-designs. Computing and analyzing distance distributions we provide new proof of…

Combinatorics · Mathematics 2020-07-07 Peter Boyvalenkov , Navid Safaei
‹ Prev 1 2 3 10 Next ›