A construction of polynomials with squarefree discriminants

By Kiran S. Kedlaya. 2011

60 citations recorded by the source corpus.

For any integer n >= 2 and any nonnegative integers r,s with r+2s = n, we give an unconditional construction of infinitely many monic irreducible polynomials of degree n with integer coefficients having squarefree discriminant and exactly r real roots. These give rise to number fields of degree n, signature (r,s), Galois group S_n, and squarefree discriminant; we may also force the discriminant to be coprime to any given integer. The number of fields produced with discriminant in the range [-N, N] is at least c N^(1/(n-1)). A corollary is that for each n \geq 3, infinitely many quadratic number fields admit everywhere unramified degree n extensions whose normal closures have Galois group A_n. This generalizes results of Yamamura, who treats the case n = 5, and Uchida and Yamamoto, who allow general n but do not control the real place.

Subfields: Algebra and Number Theory, Artificial Intelligence, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/1f858a254852bb73c946ae87f6247e6e3b4de390

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

  1. Manjul Bhargava
  2. A. Shankar
  3. Xiaoheng Wang
  4. B. Gross
  5. Bjorn Poonen
  6. Melanie Matchett Wood
  7. Alexei Oblomkov
  8. Zhiwei Yun

In Artificial Intelligence

  1. Manjul Bhargava

In Geometry and Topology

  1. Manjul Bhargava
  2. A. Shankar
  3. Xiaoheng Wang
  4. B. Gross
  5. Bjorn Poonen
  6. Melanie Matchett Wood
  7. Alexei Oblomkov
  8. Zhiwei Yun

Citations in the corpus