{"title":"有理点存在的有效性是不可确定的","authors":"Natalia Garcia-Fritz , Hector Pasten , Xavier Vidaux","doi":"10.1016/j.jnt.2025.01.023","DOIUrl":null,"url":null,"abstract":"<div><div>The analogue of Hilbert's tenth problem over <span><math><mi>Q</mi></math></span> asks for an algorithm to decide the existence of rational points on algebraic varieties over this field. This remains as one of the main open problems in the area of undecidability in number theory. Besides the existence of rational points, there is also considerable interest in the problem of effectivity: one asks whether the sought rational points satisfy determined height bounds, often expressed in terms of the height of the coefficients of the equations defining the algebraic varieties under consideration. We show that, in fact, Hilbert's tenth problem over <span><math><mi>Q</mi></math></span> with (finitely many) height comparison conditions is undecidable.</div></div>","PeriodicalId":50110,"journal":{"name":"Journal of Number Theory","volume":"276 ","pages":"Pages 81-97"},"PeriodicalIF":0.6000,"publicationDate":"2025-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Effectivity for existence of rational points is undecidable\",\"authors\":\"Natalia Garcia-Fritz , Hector Pasten , Xavier Vidaux\",\"doi\":\"10.1016/j.jnt.2025.01.023\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The analogue of Hilbert's tenth problem over <span><math><mi>Q</mi></math></span> asks for an algorithm to decide the existence of rational points on algebraic varieties over this field. This remains as one of the main open problems in the area of undecidability in number theory. Besides the existence of rational points, there is also considerable interest in the problem of effectivity: one asks whether the sought rational points satisfy determined height bounds, often expressed in terms of the height of the coefficients of the equations defining the algebraic varieties under consideration. We show that, in fact, Hilbert's tenth problem over <span><math><mi>Q</mi></math></span> with (finitely many) height comparison conditions is undecidable.</div></div>\",\"PeriodicalId\":50110,\"journal\":{\"name\":\"Journal of Number Theory\",\"volume\":\"276 \",\"pages\":\"Pages 81-97\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2025-05-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Number Theory\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0022314X25001180\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Number Theory","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0022314X25001180","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
Effectivity for existence of rational points is undecidable
The analogue of Hilbert's tenth problem over asks for an algorithm to decide the existence of rational points on algebraic varieties over this field. This remains as one of the main open problems in the area of undecidability in number theory. Besides the existence of rational points, there is also considerable interest in the problem of effectivity: one asks whether the sought rational points satisfy determined height bounds, often expressed in terms of the height of the coefficients of the equations defining the algebraic varieties under consideration. We show that, in fact, Hilbert's tenth problem over with (finitely many) height comparison conditions is undecidable.
期刊介绍:
The Journal of Number Theory (JNT) features selected research articles that represent the broad spectrum of interest in contemporary number theory and allied areas. A valuable resource for mathematicians, the journal provides an international forum for the publication of original research in this field.
The Journal of Number Theory is encouraging submissions of quality, long articles where most or all of the technical details are included. The journal now considers and welcomes also papers in Computational Number Theory.
Starting in May 2019, JNT will have a new format with 3 sections:
JNT Prime targets (possibly very long with complete proofs) high impact papers. Articles published in this section will be granted 1 year promotional open access.
JNT General Section is for shorter papers. We particularly encourage submission from junior researchers. Every attempt will be made to expedite the review process for such submissions.
Computational JNT . This section aims to provide a forum to disseminate contributions which make significant use of computer calculations to derive novel number theoretic results. There will be an online repository where supplementary codes and data can be stored.