English
Related papers

Related papers: On tight Euclidean $6$-designs: an experimental re…

200 papers

A Euclidean $t$-design, as introduced by Neumaier and Seidel (1988), is a finite set ${\cal X} \subset \mathbb{R}^n$ with a weight function $w: {\cal X} \rightarrow \mathbb{R}^+$ for which $$\sum_{r \in R} W_r \overline{f}_{S_{r}} =…

Combinatorics · Mathematics 2015-12-10 Béla Bajnok

A finite set X in the Euclidean space is called an s-inner product set if the set of the usual inner products of any two distinct points in X has size s. First, we give a special upper bound for the cardinality of an s-inner product set on…

Combinatorics · Mathematics 2011-04-20 Hiroshi Nozaki

The concept of spherical $t$-design, which is a finite subset of the unit sphere, was introduced by Delsarte-Goethals-Seidel (1977). The concept of Euclidean $t$-design, which is a two step generalization of spherical design in the sense…

Combinatorics · Mathematics 2009-05-14 Eiichi Bannai , Etsuko Bannai

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

The hyperoctahedral group $H$ in $n$ dimensions (the Weyl group of Lie type $B_n$) is the subgroup of the orthogonal group generated by all transpositions of coordinates and reflections with respect to coordinate hyperplanes. A finite set…

Combinatorics · Mathematics 2024-06-07 Bela Bajnok

A set ${X}_{N}=\{x_1,\ldots,x_N\}$ of $N$ points on the unit sphere $\mathbb{S}^d,\,d\geq 2$ is a spherical $t$-design if the average of any polynomial of degree at most $t$ over the sphere is equal to the average value of the polynomial…

Metric Geometry · Mathematics 2014-01-17 Congpei An

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

Let M be a closed embedded minimal hypersurface in a Euclidean sphere of dimension n+1, we prove that it is strongly rigid. As applications we confirm the conjecture proposed by Choi and Schoen in [3] and the Chern conjecture for n less…

Differential Geometry · Mathematics 2023-12-06 Xu Han

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…

Combinatorics · Mathematics 2026-01-27 Ryutaro Misawa

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

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

Relative $t$-designs in the $n$-dimensional hypercube $\mathcal{Q}_n$ are equivalent to weighted regular $t$-wise balanced designs, which generalize combinatorial $t$-$(n,k,\lambda)$ designs by allowing multiple block sizes as well as…

Combinatorics · Mathematics 2023-05-09 Eiichi Bannai , Etsuko Bannai , Hajime Tanaka , Yan Zhu

We study Euclidean designs from the viewpoint of the potential energy. For a finite set in Euclidean space, We formulate a linear programming bound for the potential energy by applying harmonic analysis on a sphere. We also introduce the…

Combinatorics · Mathematics 2012-06-29 Tsuyoshi Miezaki , Makoto Tagami

We give a new example of Euclidean tight 6-design in $\mathbb R^{22}$.

Combinatorics · Mathematics 2012-11-27 Eiichi Bannai , Etsuko Bannai , Junichi Shigezumi

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

In this paper, we study spherical $T$-designs and their harmonic strength $\text{Hst}(X)$ on the unit circle $S^1$. For any finite set $T\subset\mathbb{N}$, we constructively demonstrate the existence of a finite design $X$ such that…

Combinatorics · Mathematics 2025-05-13 Ryutaro Misawa , Yusaku Nishimura

This paper studies numerical integration over the unit sphere $ \mathbb{S}^2 \subset \mathbb{R}^{3} $ by using spherical $t$-design, which is an equal positive weights quadrature rule with polynomial precision $t$. We investigate two kinds…

Numerical Analysis · Mathematics 2016-11-10 Congpei An , Siyong Chen

This paper provides a survey of spherical designs and their applications, with a particular emphasis on the perspective of ``numerical analysis''. A set \(X_N\) of \(N\) points on the unit sphere \(\mathbb{S}^d\) is called a…

Numerical Analysis · Mathematics 2026-01-21 Congpei An , Xiaosheng Zhuang

It is known that there is a close analogy between "Euclidean t-designs vs. spherical t-designs" and "Relative t-designs in binary Hamming association schemes vs. combinatorial t-designs". In this paper, we want to prove how much we can…

Combinatorics · Mathematics 2013-04-23 Eiichi Bannai , Etsuko Bannai , Hideo Bannai

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…

Combinatorics · Mathematics 2025-08-27 Sho Suda , Zili Xu , Wei-Hsuan Yu
‹ Prev 1 2 3 10 Next ›