Home
CV
Research
Teaching
Please input information:
degree
r
_{1}
r
_{2}
disc
_{K}

h
_{K}
Euclidean
yes
no
Display
degree
r
_{1}
r
_{2}
polynomial
discriminant
h
_{K}
Euclideanity
Euclidean minimum
number of critical points
critical points
5
10
20
50
100
no limit
fields per page
classes
Syntax
You can enter a value (e.g. 3), or an interval (e.g. 2..4), or a combination of these notions (e.g. 2..4,6). I denotes infinity if you do not want to specify an upper bound (e.g. 4..I). In the form, any field can be empty.
About the table
17560 number fields listed (among them, 15675 are normEuclidean). Critical points are elements of K where the Euclidean minimum is reached (if they exist). There are finitely many such points modulo the integers of K, they are grouped by orbits according to the action of units of K.
Other tables
These tables were built to study number fields' normEuclideanity, as for other properties, you can see these more complete tables.
http://pari.math.ubordeaux1.fr/pub/pari/packages/nftables/
http://hobbes.la.asu.edu/NFDB/
Last changed: 20150330, 14h33.