Michel Olivier
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Michel Olivier has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Francisco Diaz Y Diaz
Université Bordeaux I
7 shared publications - Henri Cohen
Université Bordeaux I
7 shared publications - François Dress
A2X (UMR 9936), Université Bordeaux I
1 shared publication - Ryotaro Okazaki
Doshisha University, Department of Mathematics, Tanabe, Kyoto, 610-03, Japan
1 shared publication - Stéphane Louboutin
Université deCaen, Campus 2, Département de Mathématiques et Mécanique, Boulevard du Maréchal Juin, BP 5186, 14032 Caen Cedex, France
1 shared publication
Latest Publications
- Open Access
- 1 August 2002
- Published by Cambridge University Press (CUP) in Compositio Mathematica
- Vol. 133 (1) , 65-93
Enumerating Quartic Dihedral Extensions of $\open Q$We give an explicit Dirichlet series for the generating function of the discriminants of quartic dihedral extensions of $\open Q$ . From this series we deduce an asymptotic formula for the number of isomorphism classes of such quartic extensions with discriminant up to a given bound. On the other hand, by using essentially classical results of genus theory combined with elementary analytical methods such as the method of the hyperbola, we show how to compute exactly this number up to quite large bounds, and we give a table of selected values.- 1 August 2002
- Published by Cambridge University Press (CUP) in Compositio Mathematica
- Vol. 133 (1) , 65-93
Open AccessEnumerating Quartic Dihedral Extensions of $\open Q$We give an explicit Dirichlet series for the generating function of the discriminants of quartic dihedral extensions of $\open Q$ . From this series we deduce an asymptotic formula for the number of isomorphism classes of such quartic extensions with discriminant up to a given bound. On the other hand, by using essentially classical results of genus theory combined with elementary analytical methods such as the method of the hyperbola, we show how to compute exactly this number up to quite large bounds, and we give a table of selected values. - Open Access
- 13 June 2002
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 72 (242) , 941-951
Constructing complete tables of quartic fields using Kummer theory
We explain how to construct tables of quartic fields of discriminant less than or equal to a given bound in an efficient manner using Kummer theory, instead of the traditional (and much less efficient) method using the geometry of numbers. As an application, we describe the computation of quartic fields of discriminant up to 10 7 10^7 , the corresponding table being available by anonymous ftp.
- 13 June 2002
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 72 (242) , 941-951
Open AccessConstructing complete tables of quartic fields using Kummer theory
We explain how to construct tables of quartic fields of discriminant less than or equal to a given bound in an efficient manner using Kummer theory, instead of the traditional (and much less efficient) method using the geometry of numbers. As an application, we describe the computation of quartic fields of discriminant up to 10 7 10^7 , the corresponding table being available by anonymous ftp.
- 1 January 2000
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 269-283
Counting Discriminants of Number Fields of Degree up to Four
- 1 January 2000
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 269-283
Counting Discriminants of Number Fields of Degree up to Four
- Open Access
- 24 February 1999
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 68 (228) , 1701-1716
Tables of octic fields with a quartic subfield
We describe the computation of extended tables of degree 8 fields with a quartic subfield, using class field theory. In particular we find the minimum discriminants for all signatures and for all the possible Galois groups. We also discuss some phenomena and statistics discovered while making the tables, such as the occurrence of 11 non-isomorphic number fields having the same discriminant, or several pairs of non-isomorphic number fields having the same Dedekind zeta function.
- 24 February 1999
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 68 (228) , 1701-1716
Open AccessTables of octic fields with a quartic subfield
We describe the computation of extended tables of degree 8 fields with a quartic subfield, using class field theory. In particular we find the minimum discriminants for all signatures and for all the possible Galois groups. We also discuss some phenomena and statistics discovered while making the tables, such as the occurrence of 11 non-isomorphic number fields having the same discriminant, or several pairs of non-isomorphic number fields having the same Dedekind zeta function.
- 1 January 1999
- Published by Taylor & Francis in Experimental Mathematics
- Vol. 8 (4) , 319-338
Polynômes prenant des valeurs premières
On décrit, essentiellement pour les polvnôrnes du second degré, deux modelès heuristiques probabilistes donnant le nombre k de valeurs premières prises par ces polynôrnes sur un intervalle de n valeurs consécutives de la variable. Le premier modèle est consacré au cas k = n et fait apparaître un “mur de Schinzel”, d'ordre de grandeur nn, en-dessous duquel l'évènement “n valeurs premières pour n valeurs consécutives de la variable” est statistiquement exceptionnel, et au-dessus duquel il est statistiquement fréquent s'i1 n'y a pas d'obstruction arithmétique, Le deuxièrne modèle est consacré au cas k < n et est fondè sur une loi binomiale avec avec une probabilité qui dérive de la constante de Hardy-Littlewood. Pour ce modèle comme pour le précédent, les expérimentations numériques présentent une concordance satisfaisante. Ce travail est complété par une table des meilleurs polvnôrnes trouvés jusqu'à n = 40338. Enfin, on donne des résultats numériques pour les polynômes de degré 3, 4 et 5. We describe two heuristic probabilistic models that give the number k of prime values of quadratic polynomials on an interval of n consecutive values of the variable. The first model is devoted to the case k = n and reveals a “Schinzel barrier”, of size nn: below this barrier, the event “n prime values for n consecutive values of the variable” is statistically exceptional, and above, it is statistically frequent provided that there is no arithmetic obstruction. The second model is devoted to the case k < n and is based on a binomial law with a probability deriving from the Hardy–Littlewood constant. For both models, numerical experiments show a satisfactory similarity. This work is illustrated with a list of the best polynomials found for n ≤ 40338. We also give some numerical results for polynomials of degree 3, 4 and 5.
- 1 January 1999
- Published by Taylor & Francis in Experimental Mathematics
- Vol. 8 (4) , 319-338
Polynômes prenant des valeurs premières
On décrit, essentiellement pour les polvnôrnes du second degré, deux modelès heuristiques probabilistes donnant le nombre k de valeurs premières prises par ces polynôrnes sur un intervalle de n valeurs consécutives de la variable. Le premier modèle est consacré au cas k = n et fait apparaître un “mur de Schinzel”, d'ordre de grandeur nn, en-dessous duquel l'évènement “n valeurs premières pour n valeurs consécutives de la variable” est statistiquement exceptionnel, et au-dessus duquel il est statistiquement fréquent s'i1 n'y a pas d'obstruction arithmétique, Le deuxièrne modèle est consacré au cas k < n et est fondè sur une loi binomiale avec avec une probabilité qui dérive de la constante de Hardy-Littlewood. Pour ce modèle comme pour le précédent, les expérimentations numériques présentent une concordance satisfaisante. Ce travail est complété par une table des meilleurs polvnôrnes trouvés jusqu'à n = 40338. Enfin, on donne des résultats numériques pour les polynômes de degré 3, 4 et 5. We describe two heuristic probabilistic models that give the number k of prime values of quadratic polynomials on an interval of n consecutive values of the variable. The first model is devoted to the case k = n and reveals a “Schinzel barrier”, of size nn: below this barrier, the event “n prime values for n consecutive values of the variable” is statistically exceptional, and above, it is statistically frequent provided that there is no arithmetic obstruction. The second model is devoted to the case k < n and is based on a binomial law with a probability deriving from the Hardy–Littlewood constant. For both models, numerical experiments show a satisfactory similarity. This work is illustrated with a list of the best polynomials found for n ≤ 40338. We also give some numerical results for polynomials of degree 3, 4 and 5.
- Open Access
- 1 April 1998
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 67 (222) , 773-795
Computing ray class groups, conductors and discriminants
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of ( Z K / m ) ∗ (\mathbb {Z}_{K}/\mathfrak {m})^{*} for an ideal m \mathfrak {m} of a number field K K , as well as ray class groups of number fields, and conductors and discriminants of the corresponding Abelian extensions. As an application we give several number fields with discriminants less than previously known ones.
- 1 April 1998
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 67 (222) , 773-795
Open AccessComputing ray class groups, conductors and discriminants
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of ( Z K / m ) ∗ (\mathbb {Z}_{K}/\mathfrak {m})^{*} for an ideal m \mathfrak {m} of a number field K K , as well as ray class groups of number fields, and conductors and discriminants of the corresponding Abelian extensions. As an application we give several number fields with discriminants less than previously known ones.
- 1 January 1998
- Published by Springer Nature
- p. 372-380
Imprimitive octic fields with small discriminants
- 1 January 1998
- Published by Springer Nature
- p. 372-380
Imprimitive octic fields with small discriminants
- Open Access
- 1 September 1997
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 349 (9) , 3657-3678
The class number one problem for some non-abelian normal CM-fields
Let $\textbf {N}$ be a non-abelian normal CM-field of degree $4p,$ $p$ any odd prime. Note that the Galois group of $\textbf {N}$ is either the dicyclic group of order $4p,$ or the dihedral group of order $4p.$ We prove that the (relative) class number of a dicyclic CM-field of degree $4p$ is always greater then one. Then, we determine all the dihedral CM-fields of degree $12$ with class number one: there are exactly nine such CM-fields.- 1 September 1997
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 349 (9) , 3657-3678
Open AccessThe class number one problem for some non-abelian normal CM-fields
Let $\textbf {N}$ be a non-abelian normal CM-field of degree $4p,$ $p$ any odd prime. Note that the Galois group of $\textbf {N}$ is either the dicyclic group of order $4p,$ or the dihedral group of order $4p.$ We prove that the (relative) class number of a dicyclic CM-field of degree $4p$ is always greater then one. Then, we determine all the dihedral CM-fields of degree $12$ with class number one: there are exactly nine such CM-fields.