google-deepmind / google-deepmind/formal-conjectures
Spherical codes
- Dominant language
- Lean
- Stars
- 1.3k
- Forks
- 485
- Avg merge
- 1d 20h
- Merged PRs (30d)
- 328
Description
### What is the conjecture
For given dimension $n$, number of points $N$, find optimal configuration of $N$ unit vectors in $\mathbb{R}^n$ so that maximum of pairwise inner products is smallest as possible. See [here](https://cohn.mit.edu/sloane/) for some records. There are many known results and conjectures, e.g. see [this paper](https://arxiv.org/pdf/2403.16874).
### Prerequisites needed
None
### [AMS categories](https://github.com/google-deepmind/formal-conjectures/labels?q=ams-)
* ams-52
### Choose either option
- [x] I plan on working on this conjecture
- [ ] This issue is up for grabs: I would like to see this conjecture added by somebody else
Contributor guide
Assessment
This issue has not been assessed yet.