Timeline for Number of elements of "$\mathrm{SL}_n(\mathbb{F}_p^\times)$" mod $p$
Current License: CC BY-SA 3.0
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 26, 2014 at 18:29 | comment | added | Noam D. Elkies | Ah, that explains it: I didn't think Waring did this too. But as I understand it the case of a single hypersurface is due to Chevalley (and a complete intersection is Chevalley-Warning). Also, the residue mod $p^e$ won't be as straightforward as I imagined because you need $en+1$ variables, not $n+e$, to get a congruence mod $p^e$; but maybe $e=2$ is still tractable. | |
Dec 26, 2014 at 17:58 | history | edited | Will Sawin | CC BY-SA 3.0 |
added 1 character in body
|
Dec 26, 2014 at 7:34 | vote | accept | alpoge | ||
Dec 26, 2014 at 7:34 | comment | added | alpoge | Yes!! Nice argument! Just a quick typo: it should be Warning. But anyway that settles it for me. Thanks! | |
Dec 26, 2014 at 2:25 | comment | added | Noam D. Elkies | Nice; this should let you even get the count mod $p^e$ for at least the first few $e>1$. | |
Dec 26, 2014 at 1:53 | history | edited | Qiaochu Yuan | CC BY-SA 3.0 |
Minor LaTeX edits.
|
Dec 26, 2014 at 1:42 | history | answered | Will Sawin | CC BY-SA 3.0 |