Papers
Topics
Authors
Recent
Search
2000 character limit reached

Relation between spherical designs through a Hopf map

Published 28 Jun 2015 in math.MG and math.CO | (1506.08414v1)

Abstract: Cohn--Conway--Elkies--Kumar [Experiment. Math. (2007)] described that one can construct a family of designs on $S{2n-1}$ from a design on $\mathbb{CP}{n-1}$. In this paper, we prove their claim for the case where $n=2$. That is, we give an algorithm to construct $2t$-designs on $S{3}$ as products through a Hopf map $S3 \rightarrow S2$ of a $t$-design on $S2$ and a $2t$-design on $S1$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.