Optimality and uniqueness of the $D_4$ root system
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911887838412800 |
|---|---|
| author | de Laat, David Leijenhorst, Nando M. Keizer, Willem H. H. de Muinck |
| author_facet | de Laat, David Leijenhorst, Nando M. Keizer, Willem H. H. de Muinck |
| contents | We prove that the $D_4$ root system (the set of vertices of the regular $24$-cell) is the unique optimal kissing configuration in $\mathbb R^4$, and is an optimal spherical code. For this, we use semidefinite programming to compute an exact optimal solution to the second level of the Lasserre hierarchy. We also improve the upper bound for the kissing number problem in $\mathbb R^6$ to $77$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_18794 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Optimality and uniqueness of the $D_4$ root system de Laat, David Leijenhorst, Nando M. Keizer, Willem H. H. de Muinck Metric Geometry Optimization and Control 90C22, 52C17 We prove that the $D_4$ root system (the set of vertices of the regular $24$-cell) is the unique optimal kissing configuration in $\mathbb R^4$, and is an optimal spherical code. For this, we use semidefinite programming to compute an exact optimal solution to the second level of the Lasserre hierarchy. We also improve the upper bound for the kissing number problem in $\mathbb R^6$ to $77$. |
| title | Optimality and uniqueness of the $D_4$ root system |
| topic | Metric Geometry Optimization and Control 90C22, 52C17 |
| url | https://arxiv.org/abs/2404.18794 |