Quantitative Hilbert irreducibility and almost prime values of polynomial discriminants

DOI10.1093/IMRN/RNAB296MaRDI QIDQ6372158arXivFDO

Authors Theresa C. Anderson, Ayla Gafni, Robert J. Lemke Oliver, David Lowry-Duda, George Shakan, Ruixiang Zhang

Publication date 6 July 2021

Published in arXiv

Full work available at URL https://doi.org/10.1093/IMRN/RNAB296

Mathematics Subject Classification ID

Applications of sieve methods (11N36) Polynomials (irreducibility, etc.) (11R09) Units and factorization (11R27)

arXiv classification

math.NT

Abstract: We study two polynomial counting questions in arithmetic statistics via a combination of Fourier analytic and arithmetic methods. First, we obtain new quantitative forms of Hilbert's Irreducibility Theorem for degree $n$ polynomials $f$ with $mathrmGal(f)subseteq{A}_n$. We study this both for monic polynomials and non-monic polynomials. Second, we study lower bounds on the number of degree $n$ monic polynomials with almost prime discriminants, as well as the closely related problem of lower bounds on the number of degree $n$ number fields with almost prime discriminants.

This page was built for publication: Quantitative Hilbert irreducibility and almost prime values of polynomial discriminants

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