Timeline for Orthogonal similarity of matrices
Current License: CC BY-SA 2.5
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 30, 2010 at 9:41 | answer | added | Denis Serre | timeline score: 2 | |
| Sep 30, 2010 at 6:43 | comment | added | Denis Serre | @Agol. No, indeed. Because the expected result $R^TAR$ is not a cyclic permutation matrix. The diagonals $j-i=\ell$ (mod $n$) are not constant. They have a zero sum. | |
| Sep 30, 2010 at 5:52 | comment | added | Ian Agol | If you took $R$ to be unitary, then I think it is equivalent to the other problem, by diagonalizing the cyclic permutation matrix. | |
| Sep 29, 2010 at 16:20 | comment | added | Pietro Majer | For this question, I would have suggested to go and see a certain very recent book on matrices... but will not, as it's your book ;-) | |
| Sep 29, 2010 at 16:15 | comment | added | Piero D'Ancona | I see. Not trivial. | |
| Sep 29, 2010 at 15:37 | comment | added | Denis Serre | No, it is not trivial. Let me emphasize the indices are understood mod n. Thus the functions $d_\ell$ are circular sums. There are $n$ terms in each sum. | |
| Sep 29, 2010 at 15:13 | comment | added | Piero D'Ancona | Just to understand better your question: if we work with complex matrices, $A$ is unitarily equivalent to a lower triangular matrix, so the question becomes trivial, right? is there any relation with your problem? | |
| Sep 29, 2010 at 14:39 | history | asked | Denis Serre | CC BY-SA 2.5 |