Timeline for Maximum Order of elements in $GL(n,Z)$
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 12, 2010 at 19:19 | history | edited | Michael Lugo | CC BY-SA 2.5 |
added 423 characters in body
|
| Feb 12, 2010 at 18:10 | comment | added | Michael Lugo | $\phi(n)$ and $\Phi(n)$ only differ by at most 1, so $\phi(n) (\log \log n)/n$ and $\Phi(n) (\log \log n)/n$ differ by only a vanishing amount for large $n$. I think the problem with my argument is something more serious. | |
| Feb 12, 2010 at 16:04 | comment | added | Ben Webster♦ | Are you sure the switch from $\phi$ to $\boldsymbol{\Phi}$ is justified? That sounds fishhy to me. | |
| Feb 12, 2010 at 15:53 | comment | added | Portland | Thank you Michael, I think $\ln f(n) \sim \sqrt{n \ln n}$ is right, it appears in several articles, e.g. "On the Maximum Order of Torsion Elements in GL(n, Z) and Aut(Fn)" by Gilbert Levitt and Jean-Louis Nicolas | |
| Feb 12, 2010 at 15:39 | history | answered | Michael Lugo | CC BY-SA 2.5 |