Timeline for How much redundancy resides in an $n \times n$ orthogonal matrix?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 6, 2015 at 13:47 | vote | accept | Joseph O'Rourke | ||
| Jun 6, 2015 at 0:56 | comment | added | Noam D. Elkies | Generally I'd expect that $(n^2-n)/2$ entries would determine the rest up to finite choice, and that one more entry would have to be specified to remove the ambiguity (though as you note there are other ways that a collection of entries can fail almost always despite the dimension heuristic, such as when an entire row or column is unspecified). | |
| Jun 6, 2015 at 0:51 | history | answered | Robert Israel | CC BY-SA 3.0 |