2001
DOI: 10.1112/s1461157000000851
|View full text |Cite
|
Sign up to set email alerts
|

A Database for Field Extensions of the Rationals

Abstract: This paper announces the creation of a database for number fields. It describes the contents and the methods of access, indicates the origin of the polynomials, and formulates the aims of this collection of fields.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
81
0
1

Year Published

2004
2004
2017
2017

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 62 publications
(83 citation statements)
references
References 32 publications
1
81
0
1
Order By: Relevance
“…This database gives many complete determinations of K(G, D) in small degrees n, collecting previous results and going well beyond them. Our database complements the Klüners-Malle online database [25], which covers more groups and signatures, but is not as focused on completeness results and the behavior of primes. Like the Klüners-Malle database, our database is searchable and intralinked.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…This database gives many complete determinations of K(G, D) in small degrees n, collecting previous results and going well beyond them. Our database complements the Klüners-Malle online database [25], which covers more groups and signatures, but is not as focused on completeness results and the behavior of primes. Like the Klüners-Malle database, our database is searchable and intralinked.…”
Section: Introductionmentioning
confidence: 99%
“…Degree 25 080 from PSL 2 (11). The only known field K 1 with Galois group PSL 2 (11) and root discriminant less than Ω first appeared in [25] and is the splitting field of…”
mentioning
confidence: 99%
“…Early work for quartics, quintics, sextics, and septics include respectively [2][3][4]7,13,[21][22][23]25,31]. Further results towards 2 in higher degrees are extractable from the websites associated to [10,12,14].…”
Section: Overviewmentioning
confidence: 99%
“…Heuristic bound BH : We choose, as an heuristic, to begin the computation Proc CAND modulo the fifth power of the product of one, two or three minimal primes satisfying the condition state before. Comments on the experiments: We try our implementation on several polynomials given by [11] from degree 6 to 9 and some polynomials of greater degree (not more than 13) corresponding to interesting computation schemes. By using this heuristic bound, Proc CAND already computes in all the cases the final result, thus the remaining computation is the check procedure without any reconstruction.…”
Section: Experiments and Remarksmentioning
confidence: 99%