Orders with few rational monogenizations

From MaRDI portal
(Redirected from Publication:6071864)



Abstract: To an algebraic integer alpha, we can attach the order mathbbZ[alpha], and an order of this shape is called emph{monogenic}. For a not necessarily integral algebraic number alpha, say of degree n, we define an order mathbbZalpha as follows: let mathcalMalpha be the mathbbZ-module generated by 1,alpha,ldots,alphan1; then mathbbZalpha:=xiinmathbbQ(alpha):,ximathcalMalphasubseteqmathcalMalpha is the ring of scalars of mathcalMalpha. We call an order of the shape mathbbZalpha rationally monogenic. In fact, rationally monogenic orders are special types of invariant orders of binary forms, and these have been intensively studied. If are two extGL2(mathbbZ)-equivalent algebraic numbers, i.e., for some , then . Given an order mathcalO of a number field, we call any extGL2(mathbbZ)-equivalence class of alpha with mathbbZalpha=mathcalO a rational monogenization of mathcalO. 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 geq5, the Galois group of whose normal closure is five times 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.











This page was built for publication: Orders with few rational monogenizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6071864)