Polynomials with prescribed bad primes
From MaRDI portal
Abstract: We tabulate polynomials in Z[t] with a given factorization partition, bad reduction entirely within a given set of primes, and satisfying auxiliary conditions associated to 0, 1, and infinity. We explain how these sets of polynomials are of particular interest because of their role in the construction of nonsolvable number fields of arbitrarily large degree and bounded ramification. Finally we discuss the similar but technically more complicated tabulation problem corresponding to removing the auxiliary conditions.
Recommendations
- Reduction and specialization of polynomials
- Nonsolvable nonic number fields ramified only at one small prime
- Some non-Pólya biquadratic fields with low ramification
- NONSOLVABLE POLYNOMIALS WITH FIELD DISCRIMINANT 5A
- Zolotarev polynomials and reduction of Shabat polynomials into a positive characteristic
Cites work
- Finding All Elliptic Curves with Good Reduction Outside a Given Set of Primes
- Finiteness Theorems for Binary Forms with Given Discriminant
- Fractalized cyclotomic polynomials
- Geometric Invariant Theory
- scientific article; zbMATH DE number 784881 (Why is no real title available?)
- Number fields unramified away from 2
- Rigid Local Systems. (AM-139)
- Solving exponential diophantine equations using lattice basis reduction algorithms
- Twin sextic algebras
This page was built for publication: Polynomials with prescribed bad primes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5253876)