Timeline for Algorithm for finding the symmetries of a linear operator
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 19 at 16:38 | answer | added | amongus | timeline score: 0 | |
| Dec 9, 2022 at 14:56 | vote | accept | Carles Gelada | ||
| Dec 6, 2022 at 18:49 | answer | added | Igor Khavkine | timeline score: 4 | |
| Dec 6, 2022 at 17:51 | comment | added | Benjamin Steinberg | If you ignore the invertibilty you get a system of linear equations in the entries of A,B. Then you have to impose the condition the determinants of A,B are nonzero. So this seems standard linear algebra. | |
| Dec 6, 2022 at 15:56 | comment | added | Carles Gelada | I think so. This might be the right definition of the group being maximal. But I'm looking for an algorithm I can turn into a computer program. How could I possibly find the set of all invertible matrices $A,B$ s.t. $MA = BM$? | |
| Dec 6, 2022 at 14:24 | comment | added | Benjamin Steinberg | Can't you take the group of all matrices $(A,B)\in GL(V)\times GL(W)$ such that $MA=BM$ and the let $\pi$ be the first projection and $\rho$ the second? This would seem to be an algebraic group and I guess is maximal with respect to $\rho,\pi$ being jointly faithful. | |
| Dec 6, 2022 at 11:57 | history | edited | YCor | CC BY-SA 4.0 |
formatting
|
| Dec 6, 2022 at 11:44 | history | asked | Carles Gelada | CC BY-SA 4.0 |