Papers
Topics
Authors
Recent
Search
2000 character limit reached

Probabilistic Galois Theory

Published 11 Nov 2011 in math.NT | (1111.2853v1)

Abstract: We show that there are at most $O_{n,\epsilon}(H{n-2+\sqrt{2}+\epsilon})$ monic integer polynomials of degree $n$ having height at most $H$ and Galois group different from the full symmetric group $S_n$, improving on the previous 1973 world record $O_{n}(H{n-1/2}\log H)$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.