Orders with few rational monogenizations
Abstract
For an algebraic number α of degree n, let Mα be the Z-module generated by 1,α ,… ,αn-1; then Zα:=\∈Q (α ):\, α⊂eqMα\ is the ring of scalars of Mα. We call an order of the shape Zα rationally monogenic. If α is an algebraic integer, then Zα=Z[α ] is monogenic. Rationally monogenic orders are special types of invariant orders of binary forms, which have been studied intensively. If α ,β are two GL2(Z)-equivalent algebraic numbers, i.e., β =(aα +b)/(cα +d) for some (smallmatrixa&b\&dsmallmatrix)∈GL2(Z), then Zα=Zβ. Given an order O of a number field, we call a GL2(Z)-equivalence class of α with Zα=O a rational monogenization of O. We prove the following. If K is a quartic number field, then K has only finitely many orders with more than two rational monogenizations. This is best possible. Further, if K is a number field of degree ≥ 5, the Galois group of whose normal closure is 5-transitive, then K has only finitely many orders with more than one rational monogenization. The proof uses finiteness results for unit equations, which in turn were derived from Schmidt's Subspace Theorem. We generalize the above results to rationally monogenic orders over rings of S-integers of number fields. Our results extend work of B\'erczes, Gyory and the author from 2013 on multiply monogenic orders.