On 3-distance spherical 5-designs
Combinatorics
2020-07-07 v1
Abstract
Inspired by a recently formulated conjecture by Bannai et al. we investigate spherical codes which admit exactly three different distances and are spherical 5-designs. Computing and analyzing distance distributions we provide new proof of the fact (due to Levenshtein) that such codes are maximal and rule out certain cases towards a proof of the conjecture.
Cite
@article{arxiv.2007.01895,
title = {On 3-distance spherical 5-designs},
author = {Peter Boyvalenkov and Navid Safaei},
journal= {arXiv preprint arXiv:2007.01895},
year = {2020}
}
Comments
8 pages, submitted