Attila Bérczes, Yann Bugeaud, Kálmán Győry, Jorge Mello, Alina Ostafe, Min Sha
{"title":"数域上超椭圆方程解的显式边界","authors":"Attila Bérczes, Yann Bugeaud, Kálmán Győry, Jorge Mello, Alina Ostafe, Min Sha","doi":"10.1515/forum-2023-0381","DOIUrl":null,"url":null,"abstract":"Let <jats:italic>f</jats:italic> be a polynomial with coefficients in the ring <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:msub> <m:mi>O</m:mi> <m:mi>S</m:mi> </m:msub> </m:math> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_forum-2023-0381_eq_0397.png\" /> <jats:tex-math>{O_{S}}</jats:tex-math> </jats:alternatives> </jats:inline-formula> of <jats:italic>S</jats:italic>-integers of a number field <jats:italic>K</jats:italic>, <jats:italic>b</jats:italic> a non-zero <jats:italic>S</jats:italic>-integer, and <jats:italic>m</jats:italic> an integer <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mrow> <m:mi /> <m:mo>≥</m:mo> <m:mn>2</m:mn> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_forum-2023-0381_eq_0497.png\" /> <jats:tex-math>{\\geq 2}</jats:tex-math> </jats:alternatives> </jats:inline-formula>. We consider the following equation <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mrow> <m:mo stretchy=\"false\">(</m:mo> <m:mo>⋆</m:mo> <m:mo stretchy=\"false\">)</m:mo> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_forum-2023-0381_eq_0302.png\" /> <jats:tex-math>{(\\star)}</jats:tex-math> </jats:alternatives> </jats:inline-formula>: <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mrow> <m:mrow> <m:mi>f</m:mi> <m:mo></m:mo> <m:mrow> <m:mo stretchy=\"false\">(</m:mo> <m:mi>x</m:mi> <m:mo stretchy=\"false\">)</m:mo> </m:mrow> </m:mrow> <m:mo>=</m:mo> <m:mrow> <m:mi>b</m:mi> <m:mo></m:mo> <m:msup> <m:mi>y</m:mi> <m:mi>m</m:mi> </m:msup> </m:mrow> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_forum-2023-0381_eq_0620.png\" /> <jats:tex-math>{f(x)=by^{m}}</jats:tex-math> </jats:alternatives> </jats:inline-formula> in <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mrow> <m:mrow> <m:mi>x</m:mi> <m:mo>,</m:mo> <m:mi>y</m:mi> </m:mrow> <m:mo>∈</m:mo> <m:msub> <m:mi>O</m:mi> <m:mi>S</m:mi> </m:msub> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_forum-2023-0381_eq_0734.png\" /> <jats:tex-math>{x,y\\in O_{S}}</jats:tex-math> </jats:alternatives> </jats:inline-formula>. Under the well-known LeVeque condition, we give fully explicit upper bounds in terms of <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mrow> <m:mi>K</m:mi> <m:mo>,</m:mo> <m:mi>S</m:mi> <m:mo>,</m:mo> <m:mi>f</m:mi> <m:mo>,</m:mo> <m:mi>m</m:mi> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_forum-2023-0381_eq_0344.png\" /> <jats:tex-math>{K,S,f,m}</jats:tex-math> </jats:alternatives> </jats:inline-formula> and the <jats:italic>S</jats:italic>-norm of <jats:italic>b</jats:italic> for the heights of the solutions <jats:italic>x</jats:italic> of equation <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mrow> <m:mo stretchy=\"false\">(</m:mo> <m:mo>⋆</m:mo> <m:mo stretchy=\"false\">)</m:mo> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_forum-2023-0381_eq_0302.png\" /> <jats:tex-math>{(\\star)}</jats:tex-math> </jats:alternatives> </jats:inline-formula>. Further, we give an explicit bound <jats:italic>C</jats:italic> in terms of <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mrow> <m:mi>K</m:mi> <m:mo>,</m:mo> <m:mi>S</m:mi> <m:mo>,</m:mo> <m:mi>f</m:mi> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_forum-2023-0381_eq_0345.png\" /> <jats:tex-math>{K,S,f}</jats:tex-math> </jats:alternatives> </jats:inline-formula> and the <jats:italic>S</jats:italic>-norm of <jats:italic>b</jats:italic> such that if <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mrow> <m:mi>m</m:mi> <m:mo>></m:mo> <m:mi>C</m:mi> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_forum-2023-0381_eq_0666.png\" /> <jats:tex-math>{m>C}</jats:tex-math> </jats:alternatives> </jats:inline-formula> equation <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mrow> <m:mo stretchy=\"false\">(</m:mo> <m:mo>⋆</m:mo> <m:mo stretchy=\"false\">)</m:mo> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_forum-2023-0381_eq_0302.png\" /> <jats:tex-math>{(\\star)}</jats:tex-math> </jats:alternatives> </jats:inline-formula> has only solutions with <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mrow> <m:mi>y</m:mi> <m:mo>=</m:mo> <m:mn>0</m:mn> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_forum-2023-0381_eq_0741.png\" /> <jats:tex-math>{y=0}</jats:tex-math> </jats:alternatives> </jats:inline-formula> or a root of unity. Our results are more detailed versions of work of Trelina, Brindza, Shorey and Tijdeman, Voutier and Bugeaud, and extend earlier results of Bérczes, Evertse, and Győry to polynomials with multiple roots. In contrast with the previous results, our bounds depend on the <jats:italic>S</jats:italic>-norm of <jats:italic>b</jats:italic> instead of its height.","PeriodicalId":12433,"journal":{"name":"Forum Mathematicum","volume":"26 1","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2024-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Explicit bounds for the solutions of superelliptic equations over number fields\",\"authors\":\"Attila Bérczes, Yann Bugeaud, Kálmán Győry, Jorge Mello, Alina Ostafe, Min Sha\",\"doi\":\"10.1515/forum-2023-0381\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let <jats:italic>f</jats:italic> be a polynomial with coefficients in the ring <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:msub> <m:mi>O</m:mi> <m:mi>S</m:mi> </m:msub> </m:math> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_forum-2023-0381_eq_0397.png\\\" /> <jats:tex-math>{O_{S}}</jats:tex-math> </jats:alternatives> </jats:inline-formula> of <jats:italic>S</jats:italic>-integers of a number field <jats:italic>K</jats:italic>, <jats:italic>b</jats:italic> a non-zero <jats:italic>S</jats:italic>-integer, and <jats:italic>m</jats:italic> an integer <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mrow> <m:mi /> <m:mo>≥</m:mo> <m:mn>2</m:mn> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_forum-2023-0381_eq_0497.png\\\" /> <jats:tex-math>{\\\\geq 2}</jats:tex-math> </jats:alternatives> </jats:inline-formula>. We consider the following equation <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mrow> <m:mo stretchy=\\\"false\\\">(</m:mo> <m:mo>⋆</m:mo> <m:mo stretchy=\\\"false\\\">)</m:mo> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_forum-2023-0381_eq_0302.png\\\" /> <jats:tex-math>{(\\\\star)}</jats:tex-math> </jats:alternatives> </jats:inline-formula>: <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mrow> <m:mrow> <m:mi>f</m:mi> <m:mo></m:mo> <m:mrow> <m:mo stretchy=\\\"false\\\">(</m:mo> <m:mi>x</m:mi> <m:mo stretchy=\\\"false\\\">)</m:mo> </m:mrow> </m:mrow> <m:mo>=</m:mo> <m:mrow> <m:mi>b</m:mi> <m:mo></m:mo> <m:msup> <m:mi>y</m:mi> <m:mi>m</m:mi> </m:msup> </m:mrow> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_forum-2023-0381_eq_0620.png\\\" /> <jats:tex-math>{f(x)=by^{m}}</jats:tex-math> </jats:alternatives> </jats:inline-formula> in <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mrow> <m:mrow> <m:mi>x</m:mi> <m:mo>,</m:mo> <m:mi>y</m:mi> </m:mrow> <m:mo>∈</m:mo> <m:msub> <m:mi>O</m:mi> <m:mi>S</m:mi> </m:msub> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_forum-2023-0381_eq_0734.png\\\" /> <jats:tex-math>{x,y\\\\in O_{S}}</jats:tex-math> </jats:alternatives> </jats:inline-formula>. Under the well-known LeVeque condition, we give fully explicit upper bounds in terms of <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mrow> <m:mi>K</m:mi> <m:mo>,</m:mo> <m:mi>S</m:mi> <m:mo>,</m:mo> <m:mi>f</m:mi> <m:mo>,</m:mo> <m:mi>m</m:mi> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_forum-2023-0381_eq_0344.png\\\" /> <jats:tex-math>{K,S,f,m}</jats:tex-math> </jats:alternatives> </jats:inline-formula> and the <jats:italic>S</jats:italic>-norm of <jats:italic>b</jats:italic> for the heights of the solutions <jats:italic>x</jats:italic> of equation <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mrow> <m:mo stretchy=\\\"false\\\">(</m:mo> <m:mo>⋆</m:mo> <m:mo stretchy=\\\"false\\\">)</m:mo> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_forum-2023-0381_eq_0302.png\\\" /> <jats:tex-math>{(\\\\star)}</jats:tex-math> </jats:alternatives> </jats:inline-formula>. Further, we give an explicit bound <jats:italic>C</jats:italic> in terms of <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mrow> <m:mi>K</m:mi> <m:mo>,</m:mo> <m:mi>S</m:mi> <m:mo>,</m:mo> <m:mi>f</m:mi> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_forum-2023-0381_eq_0345.png\\\" /> <jats:tex-math>{K,S,f}</jats:tex-math> </jats:alternatives> </jats:inline-formula> and the <jats:italic>S</jats:italic>-norm of <jats:italic>b</jats:italic> such that if <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mrow> <m:mi>m</m:mi> <m:mo>></m:mo> <m:mi>C</m:mi> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_forum-2023-0381_eq_0666.png\\\" /> <jats:tex-math>{m>C}</jats:tex-math> </jats:alternatives> </jats:inline-formula> equation <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mrow> <m:mo stretchy=\\\"false\\\">(</m:mo> <m:mo>⋆</m:mo> <m:mo stretchy=\\\"false\\\">)</m:mo> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_forum-2023-0381_eq_0302.png\\\" /> <jats:tex-math>{(\\\\star)}</jats:tex-math> </jats:alternatives> </jats:inline-formula> has only solutions with <jats:inline-formula> <jats:alternatives> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mrow> <m:mi>y</m:mi> <m:mo>=</m:mo> <m:mn>0</m:mn> </m:mrow> </m:math> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_forum-2023-0381_eq_0741.png\\\" /> <jats:tex-math>{y=0}</jats:tex-math> </jats:alternatives> </jats:inline-formula> or a root of unity. Our results are more detailed versions of work of Trelina, Brindza, Shorey and Tijdeman, Voutier and Bugeaud, and extend earlier results of Bérczes, Evertse, and Győry to polynomials with multiple roots. In contrast with the previous results, our bounds depend on the <jats:italic>S</jats:italic>-norm of <jats:italic>b</jats:italic> instead of its height.\",\"PeriodicalId\":12433,\"journal\":{\"name\":\"Forum Mathematicum\",\"volume\":\"26 1\",\"pages\":\"\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2024-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Forum Mathematicum\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1515/forum-2023-0381\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Forum Mathematicum","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1515/forum-2023-0381","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
摘要
设 f 是一个多项式,其系数在数域 K 的 S 整数环 O S {O_{S}} 中,b 是一个非零 S 整数,m 是一个整数 ≥ 2 {\geq 2} 。我们考虑以下方程 ( ⋆ ) {(\star)} : f ( x ) = b y m {f(x)=by^{m}} in x , y ∈ O S {x,y\in O_{S}}. .在著名的 LeVeque 条件下,我们给出了方程 ( ⋆ ) {(\star)} 的解 x 的高度的 K , S , f , m {K,S,f,m} 和 b 的 S-norm 的完全明确的上限。此外,我们还给出了 K , S , f {K,S,f} 和 b 的 S-norm 的明确约束 C,即如果 m > C {m>C} 等式 ( ⋆ ) {(\star)} 只有 y = 0 {y=0} 或一个同根的解。我们的结果是 Trelina、Brindza、Shorey 和 Tijdeman、Voutier 和 Bugeaud 工作的更详细版本,并将 Bérczes、Evertse 和 Győry 早期的结果扩展到多根多项式。与之前的结果不同,我们的界限取决于 b 的 S-norm 而不是其高度。
Explicit bounds for the solutions of superelliptic equations over number fields
Let f be a polynomial with coefficients in the ring OS{O_{S}} of S-integers of a number field K, b a non-zero S-integer, and m an integer ≥2{\geq 2}. We consider the following equation (⋆){(\star)}: f(x)=bym{f(x)=by^{m}} in x,y∈OS{x,y\in O_{S}}. Under the well-known LeVeque condition, we give fully explicit upper bounds in terms of K,S,f,m{K,S,f,m} and the S-norm of b for the heights of the solutions x of equation (⋆){(\star)}. Further, we give an explicit bound C in terms of K,S,f{K,S,f} and the S-norm of b such that if m>C{m>C} equation (⋆){(\star)} has only solutions with y=0{y=0} or a root of unity. Our results are more detailed versions of work of Trelina, Brindza, Shorey and Tijdeman, Voutier and Bugeaud, and extend earlier results of Bérczes, Evertse, and Győry to polynomials with multiple roots. In contrast with the previous results, our bounds depend on the S-norm of b instead of its height.
期刊介绍:
Forum Mathematicum is a general mathematics journal, which is devoted to the publication of research articles in all fields of pure and applied mathematics, including mathematical physics. Forum Mathematicum belongs to the top 50 journals in pure and applied mathematics, as measured by citation impact.