Search arXivSearch

arXiv · 2508.18685

Existence and nonexistence of spherical $5$-designs of minimal type

Abstract

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 is of minimal type if and only if it possesses a specific $Q$-polynomial coherent configuration structure. For tight spherical $5$-designs in $\mathbb{R}^d$ of minimal type, we demonstrate that half of the derived code forms an equiangular tight frames (ETF) with parameters $(d-1, \frac{(d-1)(d+1)}{3})$. This provides a sufficient condition for constructing such ETFs from maximal ETFs with parameters $(d, \frac{d(d+1)}{2})$. Moreover, we establish that tight spherical $5$-designs of minimal type cannot exist if the dimension $d$ satisfies a certain arithmetic condition, which holds for infinitely many values of $d$, including $d=119$ and $527$. For antipodal spherical $4$-distance $5$-designs, we utilize valency theory to derive necessary conditions for certain special types of antipodal spherical $4$-distance $5$-designs to be of minimal type.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sho Suda, Zili Xu, Wei-Hsuan Yu. 2025-08-26. Existence and nonexistence of spherical $5$-designs of minimal type. https://arxiv.org/abs/2508.18685

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO