Timeline for Bounds on the number of elements of a given order in a finite simple group
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 2, 2022 at 14:42 | comment | added | David E Speyer | Related question mathoverflow.net/q/337477/297 (but without the hypothesis that $G$ is simple, so the answers are pretty different). | |
| Dec 18, 2021 at 9:09 | answer | added | Geoff Robinson | timeline score: 4 | |
| Dec 14, 2021 at 18:39 | comment | added | stupid_question_bot | @GeoffRobinson Do we expect $n(G,k)$ to be largest for small $k$? (eg $k = 2$?). Is it possible to quantify how the bounds improve as $k$ increases? | |
| Dec 14, 2021 at 10:02 | answer | added | Sean Eberhard | timeline score: 8 | |
| Dec 14, 2021 at 4:09 | comment | added | MSMalekan | I think we have $n(G,2)\leq\frac34|G|$ and $n(G,3)\leq\frac78|G|$. | |
| Dec 13, 2021 at 22:32 | history | asked | stupid_question_bot | CC BY-SA 4.0 |