Search arXivSearch

arXiv · 2601.17294

Constructing spherical designs using tight $t$-fusion frames

Abstract

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 $k$-dimensional subspaces in the real Grassmannian $G_{k,d}$, we place, for each such $k$-dimensional subspace, a finite set on its unit sphere, and then take the union of these sets in $S^{d-1}$. For this construction problem -- namely, obtaining spherical designs in higher dimensions by distributing point sets on lower-dimensional spheres subspace by subspace -- we provide a sufficient condition based on the framework of tight $t$-fusion frames ($\mathrm{TFF}_t$) due to Bachoc--Ehler. As a preparation for applications, we moreover give an explicit construction of equal-weight tight $2$-fusion frames on $G_{2,d}$ for infinitely many dimensions $d$, via unions of orbits of the hyperoctahedral group. We also derive necessary conditions for the existence of highly symmetric tight $t$-fusion frames, namely equi-chordal and equi-isoclinic tight $t$-fusion frames ($\mathrm{ECTFF}_t$ and $\mathrm{EITFF}_t$), on $G_{2,d}$, and in particular obtain bounds on the number of points.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ryutaro Misawa. 2026-01-24. Constructing spherical designs using tight $t$-fusion frames. https://arxiv.org/abs/2601.17294

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