Timeline for Conjugacy in $GL(n,\mathbb Z)$
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 24, 2021 at 12:28 | comment | added | Wox | FYI an application of that problem is determining what space group is described by a given set of symmetry operations (we're talking about the Euclidean group and crystal symmetries in the domain of crystallography). The authors are active in this domain so no coincidence. | |
| May 24, 2021 at 12:22 | comment | added | Wox | That sounds exactly like what I needed. Thanks @David Roe. | |
| May 24, 2021 at 12:20 | vote | accept | Wox | ||
| May 23, 2021 at 19:27 | history | edited | David Roe | CC BY-SA 4.0 |
deleted 14 characters in body
|
| May 23, 2021 at 13:15 | comment | added | Derek Holt | @YCor More practical than Grunewald's algorithm - but that makes no claims to be practical, so perhaps one should miss out the "more", | |
| May 23, 2021 at 12:05 | comment | added | YCor | more practical than what? | |
| May 23, 2021 at 4:20 | history | answered | David Roe | CC BY-SA 4.0 |