Timeline for Largest number of vectors with pairwise negative dot product
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 20, 2020 at 17:08 | history | edited | Shahrooz | CC BY-SA 4.0 |
added 2 characters in body
|
| Apr 20, 2020 at 16:07 | answer | added | M. Winter | timeline score: 9 | |
| Jul 27, 2010 at 0:25 | vote | accept | CommunityBot | ||
| Jul 12, 2010 at 10:51 | comment | added | Konrad Swanepoel | That $m\lt n+2$ is equivalent to Lemma 8 in R. A. Rankin, On the Closest Packing of Spheres in n Dimensions, Ann. of Math. 48 (1947), pp. 1062-1081. jstor link (needs subscription) | |
| Jul 11, 2010 at 20:48 | comment | added | Allen Knutson | Note that (almost) this question arises in showing that the simple roots of a Lie algebra are linearly independent. | |
| Jul 11, 2010 at 20:18 | history | edited | Charles Matthews | CC BY-SA 2.5 |
upper case title
|
| Jul 11, 2010 at 18:34 | history | edited | Theo Johnson-Freyd | CC BY-SA 2.5 |
minor TeX corrections
|
| Jul 11, 2010 at 18:09 | answer | added | Benoît Kloeckner | timeline score: 13 | |
| Jul 11, 2010 at 18:08 | answer | added | Robin Chapman | timeline score: 44 | |
| Jul 11, 2010 at 18:06 | history | edited | user5810 | CC BY-SA 2.5 |
fixed typo
|
| Jul 11, 2010 at 17:47 | history | asked | user5810 | CC BY-SA 2.5 |