<p>We determine the quadratic points on the modular curves <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(X_0(N)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>X</mi> <mn>0</mn> </msub> <mrow> <mo stretchy="false">(</mo> <mi>N</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> for <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(N\le 100\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>N</mi> <mo>≤</mo> <mn>100</mn> </mrow> </math></EquationSource> </InlineEquation> for which this has not been previously done, namely the cases <Equation ID="Equ2"> <EquationSource Format="TEX">\(\begin{aligned} N\in \{66,70,78,82,84,86,87,88,90,96,99\}. \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <mi>N</mi> <mo>∈</mo> <mo stretchy="false">{</mo> <mn>66</mn> <mo>,</mo> <mn>70</mn> <mo>,</mo> <mn>78</mn> <mo>,</mo> <mn>82</mn> <mo>,</mo> <mn>84</mn> <mo>,</mo> <mn>86</mn> <mo>,</mo> <mn>87</mn> <mo>,</mo> <mn>88</mn> <mo>,</mo> <mn>90</mn> <mo>,</mo> <mn>96</mn> <mo>,</mo> <mn>99</mn> <mo stretchy="false">}</mo> <mo>.</mo> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>We accomplish this by improving on the “going down method,” which uses the fact that we have a moduli description of all the (infinitely many) quadratic points on <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(X_0(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>X</mi> <mn>0</mn> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> for some divisor <i>n</i> of <i>N</i>.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Quadratic points on modular curves \(X_0(N)\) for \(N\le 100\)

  • Filip Najman,
  • Ivan Novak

摘要

We determine the quadratic points on the modular curves \(X_0(N)\) X 0 ( N ) for \(N\le 100\) N 100 for which this has not been previously done, namely the cases \(\begin{aligned} N\in \{66,70,78,82,84,86,87,88,90,96,99\}. \end{aligned}\) N { 66 , 70 , 78 , 82 , 84 , 86 , 87 , 88 , 90 , 96 , 99 } . We accomplish this by improving on the “going down method,” which uses the fact that we have a moduli description of all the (infinitely many) quadratic points on \(X_0(n)\) X 0 ( n ) for some divisor n of N.