English

On spherical 4-distance 7-designs

Combinatorics 2021-10-12 v1

Abstract

We investigate spherical 4-distance 7-designs by studying their distance distributions. We compute these distance distributions and use their product (an integer) to derive certain divisibility conditions relating the dimension nn and the cardinality MM of our designs. It follows that nn divides 12M12M and n+1n+1 divides 4M24M^2. This result provides a good base for computer experiments to support the folklore conjecture that the only spherical 4-distance 7-designs are the tight spherical 7-designs. We then proceed with a computer assisted proof of this conjecture in all dimensions n1000n \leq 1000.

Keywords

Cite

@article{arxiv.2110.04635,
  title  = {On spherical 4-distance 7-designs},
  author = {Peter Boyvalenkov and Navid Safaei},
  journal= {arXiv preprint arXiv:2110.04635},
  year   = {2021}
}

Comments

5 pages, to be presented at XVII International Symposium Problems of Redundancy in Information and Control Systems

R2 v1 2026-06-24T06:45:52.179Z