Timeline for Standard Gram matrices for lattices
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 12, 2022 at 22:34 | comment | added | Dan Haxton | Oh thank you! I did not notice that. It is a very dense paper imho. | |
| Feb 11, 2022 at 21:13 | comment | added | Mark Schultz-Wu | @DanHaxton their code is online (they cite it) here, I encourage you to explore this yourself. | |
| Feb 11, 2022 at 18:04 | comment | added | Dan Haxton | This paper is beyond my expertise unfortunately; I cannot understand their Can(A). The standard I proposed is based on an optimization problem, a scalar function cost(U'AU), B = Can(A) = U'AU, cost is to be minimized wrt U, U(A) = argmin_U cost(U'AU). Please let me know if you understand what their Can(A) function gives for A = gram matrix of E8. My gram matrix B = Can(gramE8) corresponds to the graph of a cube as I described; furthermore, the unique (?) complete nonintersecting edge circuit of the 8 vertices of the cube may be drawn based on whether the edges correspond to B(i,j) = -1 or 1 | |
| Feb 11, 2022 at 6:11 | vote | accept | Dan Haxton | ||
| Feb 9, 2022 at 23:49 | history | edited | Mark Schultz-Wu | CC BY-SA 4.0 |
added 441 characters in body
|
| Feb 9, 2022 at 23:44 | history | answered | Mark Schultz-Wu | CC BY-SA 4.0 |