{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T19:35:41Z","timestamp":1776800141366,"version":"3.51.2"},"reference-count":29,"publisher":"American Mathematical Society (AMS)","issue":"297","license":[{"start":{"date-parts":[[2016,6,9]],"date-time":"2016-06-09T00:00:00Z","timestamp":1465430400000},"content-version":"am","delay-in-days":366,"URL":"https:\/\/www.ams.org\/publications\/copyright-and-permissions"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Comp."],"abstract":"<p>\n                    We construct an algorithm for solving the following problem: given a number field\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"upper K\">\n                        <mml:semantics>\n                          <mml:mi>K<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">K<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    , a positive integer\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"upper N\">\n                        <mml:semantics>\n                          <mml:mi>N<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">N<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    , and a positive real number\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"upper B\">\n                        <mml:semantics>\n                          <mml:mi>B<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">B<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    , determine all points in\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"double-struck upper P Superscript upper N Baseline left-parenthesis upper K right-parenthesis\">\n                        <mml:semantics>\n                          <mml:mrow>\n                            <mml:msup>\n                              <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                                <mml:mi mathvariant=\"double-struck\">P<\/mml:mi>\n                              <\/mml:mrow>\n                              <mml:mi>N<\/mml:mi>\n                            <\/mml:msup>\n                            <mml:mo stretchy=\"false\">(<\/mml:mo>\n                            <mml:mi>K<\/mml:mi>\n                            <mml:mo stretchy=\"false\">)<\/mml:mo>\n                          <\/mml:mrow>\n                          <mml:annotation encoding=\"application\/x-tex\">\\mathbb {P}^N(K)<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    having relative height at most\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"upper B\">\n                        <mml:semantics>\n                          <mml:mi>B<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">B<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    . A theoretical analysis of the efficiency of the algorithm is provided, as well as sample computations showing how the algorithm performs in practice. Two variants of the method are described, and examples are given to compare their running times. In the case\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"upper N equals 1\">\n                        <mml:semantics>\n                          <mml:mrow>\n                            <mml:mi>N<\/mml:mi>\n                            <mml:mo>=<\/mml:mo>\n                            <mml:mn>1<\/mml:mn>\n                          <\/mml:mrow>\n                          <mml:annotation encoding=\"application\/x-tex\">N=1<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    we compare our method to an earlier algorithm for enumerating elements of bounded height in number fields.\n                  <\/p>","DOI":"10.1090\/mcom\/2984","type":"journal-article","created":{"date-parts":[[2015,6,9]],"date-time":"2015-06-09T10:54:14Z","timestamp":1433847254000},"page":"423-447","source":"Crossref","is-referenced-by-count":0,"title":["Computing points of bounded height in projective space over a number field"],"prefix":"10.1090","volume":"85","author":[{"given":"David","family":"Krumm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"14","published-online":{"date-parts":[[2015,6,9]]},"reference":[{"key":"1","unstructured":"V. Baldoni et al., A user\u2019s guide for LattE integrale v1.6, 2013, Available online at \\url{http:\/\/www.math.ucdavis.edu\/ latte\/}."},{"key":"2","isbn-type":"print","first-page":"91","article-title":"An algorithmic theory of lattice points in polyhedra","author":"Barvinok, Alexander","year":"1999","ISBN":"https:\/\/id.crossref.org\/isbn\/0521770874"},{"issue":"4","key":"3","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1287\/moor.19.4.769","article-title":"A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed","volume":"19","author":"Barvinok, Alexander I.","year":"1994","journal-title":"Math. Oper. Res.","ISSN":"https:\/\/id.crossref.org\/issn\/0364-765X","issn-type":"print"},{"issue":"2","key":"4","doi-asserted-by":"publisher","first-page":"141","DOI":"10.3934\/amc.2010.4.141","article-title":"Improvements in the computation of ideal class groups of imaginary quadratic number fields","volume":"4","author":"Biasse, Jean-Fran\u00e7ois","year":"2010","journal-title":"Adv. Math. Commun.","ISSN":"https:\/\/id.crossref.org\/issn\/1930-5346","issn-type":"print"},{"key":"5","isbn-type":"print","first-page":"27","article-title":"A subexponential algorithm for the determination of class groups and regulators of algebraic number fields","author":"Buchmann, Johannes","year":"1990","ISBN":"https:\/\/id.crossref.org\/isbn\/0817634932"},{"key":"6","series-title":"Graduate Texts in Mathematics","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02945-9","volume-title":"A course in computational algebraic number theory","volume":"138","author":"Cohen, Henri","year":"1993","ISBN":"https:\/\/id.crossref.org\/isbn\/3540556400"},{"issue":"4","key":"7","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1016\/j.jsc.2003.04.003","article-title":"Effective lattice point counting in rational convex polytopes","volume":"38","author":"De Loera, Jes\u00fas A.","year":"2004","journal-title":"J. Symbolic Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0747-7171","issn-type":"print"},{"key":"8","unstructured":"L. Demb\u00e9l\u00e9 and A. Kumar, Examples of abelian surfaces with everywhere good reduction, Preprint, \\url{http:\/\/arxiv.org\/abs\/1309.3821}."},{"key":"9","first-page":"507","article-title":"Preperiodic points for quadratic polynomials over quadratic fields","volume":"20","author":"Doyle, John R.","year":"2014","journal-title":"New York J. Math."},{"key":"10","doi-asserted-by":"crossref","unstructured":"J. R. Doyle and D. Krumm, Computing algebraic numbers of bounded height, Math. Comp. Published electronically, April 1, 2015.","DOI":"10.1090\/mcom\/2954"},{"key":"11","isbn-type":"print","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-12868-9_103","article-title":"A procedure for determining algebraic integers of given norm","author":"Fincke, U.","year":"1983","ISBN":"https:\/\/id.crossref.org\/isbn\/3540128689"},{"issue":"170","key":"12","doi-asserted-by":"publisher","first-page":"463","DOI":"10.2307\/2007966","article-title":"Improved methods for calculating vectors of short length in a lattice, including a complexity analysis","volume":"44","author":"Fincke, U.","year":"1985","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"issue":"4","key":"13","doi-asserted-by":"publisher","first-page":"837","DOI":"10.2307\/1990896","article-title":"A rigorous subexponential algorithm for computation of class groups","volume":"2","author":"Hafner, James L.","year":"1989","journal-title":"J. Amer. Math. Soc.","ISSN":"https:\/\/id.crossref.org\/issn\/0894-0347","issn-type":"print"},{"issue":"226","key":"14","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1090\/S0025-5718-99-01003-0","article-title":"Applying sieving to the computation of quadratic class groups","volume":"68","author":"Jacobson, Michael J., Jr.","year":"1999","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"key":"15","doi-asserted-by":"crossref","unstructured":"S. Lang, Fundamentals of Diophantine Geometry, Springer-Verlag, New York, 1983.","DOI":"10.1007\/978-1-4757-1810-2"},{"key":"16","series-title":"Graduate Texts in Mathematics","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0853-2","volume-title":"Algebraic number theory","volume":"110","author":"Lang, Serge","year":"1994","ISBN":"https:\/\/id.crossref.org\/isbn\/0387942254","edition":"2"},{"issue":"4","key":"17","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","article-title":"Factoring polynomials with rational coefficients","volume":"261","author":"Lenstra, A. K.","year":"1982","journal-title":"Math. Ann.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5831","issn-type":"print"},{"issue":"2","key":"18","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1090\/S0273-0979-1992-00284-7","article-title":"Algorithms in algebraic number theory","volume":"26","author":"Lenstra, H. W., Jr.","year":"1992","journal-title":"Bull. Amer. Math. Soc. (N.S.)","ISSN":"https:\/\/id.crossref.org\/issn\/0273-0979","issn-type":"print"},{"issue":"3","key":"19","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1137\/070705702","article-title":"An LLL algorithm with quadratic complexity","volume":"39","author":"Nguyen, Phong Q.","year":"2009","journal-title":"SIAM J. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0097-5397","issn-type":"print"},{"issue":"1-2","key":"20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1015225430108","article-title":"Elements with bounded height in number fields","volume":"43","author":"Peth\u0151, A.","year":"2001","journal-title":"Period. Math. Hungar.","ISSN":"https:\/\/id.crossref.org\/issn\/0031-5303","issn-type":"print"},{"key":"21","series-title":"Encyclopedia of Mathematics and its Applications","isbn-type":"print","volume-title":"Algorithmic algebraic number theory","volume":"30","author":"Pohst, M.","year":"1997","ISBN":"https:\/\/id.crossref.org\/isbn\/0521596696"},{"issue":"4","key":"22","doi-asserted-by":"crossref","first-page":"433","DOI":"10.24033\/bsmf.1905","article-title":"Heights in number fields","volume":"107","author":"Schanuel, Stephen Hoel","year":"1979","journal-title":"Bull. Soc. Math. France","ISSN":"https:\/\/id.crossref.org\/issn\/0037-9484","issn-type":"print"},{"key":"23","series-title":"Graduate Texts in Mathematics","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-69904-2","volume-title":"The arithmetic of dynamical systems","volume":"241","author":"Silverman, Joseph H.","year":"2007","ISBN":"https:\/\/id.crossref.org\/isbn\/9780387699035"},{"key":"24","unstructured":"W. A. Stein et al., Sage Mathematics Software (Version 5.9), The Sage Development Team, 2013, \\url{http:\/\/www.sagemath.org}."},{"key":"25","unstructured":"M. Stoll, An explicit theory of heights for hyperelliptic jacobians of genus three, Preprint."},{"issue":"2","key":"26","doi-asserted-by":"publisher","first-page":"183","DOI":"10.4064\/aa-90-2-183-201","article-title":"On the height constant for curves of genus two","volume":"90","author":"Stoll, Michael","year":"1999","journal-title":"Acta Arith.","ISSN":"https:\/\/id.crossref.org\/issn\/0065-1036","issn-type":"print"},{"issue":"2","key":"27","doi-asserted-by":"publisher","first-page":"165","DOI":"10.4064\/aa104-2-6","article-title":"On the height constant for curves of genus two. II","volume":"104","author":"Stoll, Michael","year":"2002","journal-title":"Acta Arith.","ISSN":"https:\/\/id.crossref.org\/issn\/0065-1036","issn-type":"print"},{"issue":"9","key":"28","doi-asserted-by":"publisher","first-page":"4793","DOI":"10.1090\/S0002-9947-10-05173-1","article-title":"Counting primitive points of bounded height","volume":"362","author":"Widmer, Martin","year":"2010","journal-title":"Trans. Amer. Math. Soc.","ISSN":"https:\/\/id.crossref.org\/issn\/0002-9947","issn-type":"print"},{"issue":"2","key":"29","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1090\/S0002-9939-2011-10926-2","article-title":"Lipschitz class, narrow class, and counting lattice points","volume":"140","author":"Widmer, Martin","year":"2012","journal-title":"Proc. Amer. Math. Soc.","ISSN":"https:\/\/id.crossref.org\/issn\/0002-9939","issn-type":"print"}],"container-title":["Mathematics of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.ams.org\/mcom\/2016-85-297\/S0025-5718-2015-02984-6\/S0025-5718-2015-02984-6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/www.ams.org\/mcom\/2016-85-297\/S0025-5718-2015-02984-6\/S0025-5718-2015-02984-6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T18:38:29Z","timestamp":1776796709000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/mcom\/2016-85-297\/S0025-5718-2015-02984-6\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,9]]},"references-count":29,"journal-issue":{"issue":"297","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["S0025-5718-2015-02984-6"],"URL":"https:\/\/doi.org\/10.1090\/mcom\/2984","archive":["CLOCKSS","Portico"],"relation":{},"ISSN":["1088-6842","0025-5718"],"issn-type":[{"value":"1088-6842","type":"electronic"},{"value":"0025-5718","type":"print"}],"subject":[],"published":{"date-parts":[[2015,6,9]]}}}