The complexity of computing all subfields of an algebraic number field. (July 2019)

• Record Type: Journal Article
• Authors: Szutkoski, Jonas; van Hoeij, Mark
• Is Part Of: Journal of symbolic computation. Volume 93(2019)
• Page Start: 161
• Page End: 182
• Publication Date: 2019-07
• Subjects: Subfields -- Lattice -- Partitions; Mathematics -- Data processing -- Periodicals; Numerical analysis -- Data processing -- Periodicals; Automatic programming (Computer science) -- Periodicals; Mathématiques -- Informatique -- Périodiques; Analyse numérique -- Informatique -- Périodiques; Programmation automatique -- Périodiques; Automatic programming (Computer science); Mathematics -- Data processing; Numerical analysis -- Data processing; Periodicals; Electronic journals; 510.285
• DOI: 10.1016/j.jsc.2018.06.001
• Languages: English
• ISSNs: 0747-7171

Abstract

Abstract: For a finite separable field extension K / k, all subfields can be obtained by intersecting so-called principal subfields of K / k . In this work we present a way to quickly compute these intersections. If the number of subfields is high, then this leads to faster run times and an improved complexity.