Timeline for Most discriminants are almost squarefree
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 4, 2016 at 19:16 | comment | added | alpoge | Yeah! I actually asked Bhargava about this this past summer and he said he, Arul, and Jerry had proved what I needed. I figured I could just wait til the preprint came out to answer this question since I assumed nobody had noticed it on MathOverflow! But anyway it's an amazing result! | |
| Feb 4, 2016 at 16:16 | comment | added | Frank Thorne | @StanleyYaoXiao: Cool!! | |
| Feb 4, 2016 at 16:16 | history | edited | Frank Thorne | CC BY-SA 3.0 |
added 23 characters in body
|
| Feb 4, 2016 at 14:47 | comment | added | Stanley Yao Xiao | Jerry Wang recently gave a talk here (Waterloo) where he claimed to have proved the expected counting theorem for square-free discriminants for every degree with Bhargava and Shankar. The trick is to generalize the 'using geometry of numbers to count orbits having bounded invariants' method to cases where the group acting on the space is not reductive. This paper has not yet appeared, even on arxiv, as far as I know. I assume it will be a sequel to this paper: arxiv.org/pdf/1512.03035.pdf | |
| Feb 4, 2016 at 14:37 | history | answered | Frank Thorne | CC BY-SA 3.0 |