Abstract
The reduction algorithm is used to compute the reduced ideals of a number field. However, there are reduced ideals that can never be obtained from this algorithm. In this paper, we will show that these ideals have inverses of larger norms among reduced ones. Especially, for some number fields, we present the conditions of the reduced ideals produced by the reduction algorithm. Additionally, our results partly answer the question by R. Schoof who asks about the number of the reduced ideals that can not be produced by the reduction algorithm.
Similar content being viewed by others
References
Buchmann, J.: A subexponential algorithm for the determination of class groups and regulators of algebraic number fields. Séminaire de théorie des nombres, Paris 1989(1990), 27–41 (1988)
Buchmann, J., Williams, H.C.: On the infrastructure of the principal ideal class of an algebraic number field of unit rank one. Math. Comput. 50(182), 569–579 (1988)
Fourier, J.: Histoire de l’académie, partie mathématique. Mémoire de l’Académie des sciences de l’Institut de France, 1824
Hermite, C.: Extraits de lettres de m. ch. hermite à m. jacobi sur différents objects de la théorie des nombres.(continuation). J. für die reine und Angew. Math. (Crelles J.) 1850(40):279–315 (1850)
Lenstra, H.: Lattices. In: Algorithmic Number Theory MSRI Publications, vol. 44 (2008)
Lenstra, H.W.: On the calculation of regulators and class numbers of quadratic fields. Journées Arithmétiques 1980 Lond. Math. Soc. Lecture Note Ser. 56, 123–150 (1982)
Schoof, R.: Quadratic fields and factorization. Comput. Methods Number Theory (1984)
Schoof, R.: Computing Arakelov class groups. In: Algorithmic Number Theory: Lattices, Number Fields, Curves and Cryptography, pp. 447–495. Cambridge University Press (2008)
Shanks, D.: The infrastructure of a real quadratic field and its applications. In: Proceedings of the Number Theory Conference, pp. 217–224 (1972)
Tran, H.T.N.: On reduced Arakelov divisors of real quadratic fields. Acta Arith. 173, 297–315 (2016)
Acknowledgements
Peng Tian is supported by NSFC (NOs: 11601153) and Ha T. N. Tran was supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) (funding RGPIN-2019-04209 and DGECR-2019-00428).
Funding
The authors have not disclosed any funding.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declared that they have no conflicts of interest to this work.
Data availability
The datasets generated during and/or analysed during the current study are available from the corresponding author on reasonable request.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Tian, P., Tran, H.T.N. Reduced Ideals from the Reduction Algorithm. Results Math 79, 50 (2024). https://doi.org/10.1007/s00025-023-02076-1
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00025-023-02076-1