Spherical two-distance sets and graph eigenvalues
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908586445111296 |
|---|---|
| author | Zhou, Jiang |
| author_facet | Zhou, Jiang |
| contents | A set of unit vectors in $\mathbb{R}^d$ is a called a spherical two-distance set if the inner products of distinct vectors only take two values. In this paper, we give explicit correspondence between spherical two-distance sets and graphs with specific spectral properties, and derive some bounds on the maximum size of spherical two-distance sets. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_11787 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Spherical two-distance sets and graph eigenvalues Zhou, Jiang Combinatorics A set of unit vectors in $\mathbb{R}^d$ is a called a spherical two-distance set if the inner products of distinct vectors only take two values. In this paper, we give explicit correspondence between spherical two-distance sets and graphs with specific spectral properties, and derive some bounds on the maximum size of spherical two-distance sets. |
| title | Spherical two-distance sets and graph eigenvalues |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2402.11787 |