Probabilistic Galois Theory -- The Square Discriminant Case

arXiv2207.12493MaRDI QIDQ6506314FDOQ6506314

Authors: Lior Bary-Soroker, Or Ben Porath, Vlad Matei 

Abstract: The paper studies the probability for a Galois group of a random polynomial to be $A_n$. We focus on the so-called large box model, where we choose the coefficients of the polynomial independently and uniformly from $-L,ldots,L$. The state-of-the-art upper bound is $O(L^{-1})$, due to Bhargava. We conjecture a much stronger upper bound $L^{-n/2+epsilon}$, and that this bound is essentially sharp. We prove strong lower bounds both on this probability and on the related probability of the discriminant being a square.

Mathematics Subject Classification ID

Galois theory (11R32) Inverse Galois theory (12F12)

This page was built for publication: Probabilistic Galois Theory -- The Square Discriminant Case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6506314)