Timeline for Is there an easy way to compute the maximum isotropic subspace over finite fields?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 2, 2019 at 3:21 | comment | added | literature-searcher | See section 2 of web.archive.org/web/20051016064639/http://www.math.unicaen.fr/… | |
| Feb 2, 2019 at 0:49 | comment | added | Chris Godsil | Quadratic forms are only equivalent to symmetric matrices in odd characteristic. | |
| Feb 2, 2019 at 0:08 | comment | added | Noam D. Elkies | Re the final paragraph: in general a method such as Gaussian elimination is still faster than computing the characteristic polynomial; the fact that symmetric matrices are diagonalizable is important for many reason, but actual computation of the rank isn't usually one of these reasons. | |
| Feb 1, 2019 at 21:30 | review | First posts | |||
| Feb 1, 2019 at 21:45 | |||||
| Feb 1, 2019 at 21:27 | history | asked | Hao | CC BY-SA 4.0 |