CONSTRUCTING NEW NON-CONGRUENT NUMBERS BY GRAPH THEORY
CONSTRUCTING NEW NON-CONGRUENT NUMBERS BY GRAPH THEORY
复制标题
DOI:
10.1142/9789812770134_0002
复制
发表时间:
2007-07
期刊:
影响因子:
--
通讯作者:
K. Feng;Y. Xue
中科院分区:
文献类型:
--
作者:
K. Feng;Y. Xue
This paper is a survey on recent results of new series of non-congruent numbers which can be acquired by traditional arithmetic theory of elliptic curves plus a result from algebraic graph theory. More precisely, we start from the following two facts: (1) A square-free positive integeris a non-congruent number if and only if the rank of the group En(ℚ) of rational points of the elliptic curve En: y2= x3- n2x is zero. (2) If the 2-Selmer groups Snandof the elliptic curve Enand its dual curvehave minimal sizes |Sn| = 1 and, then rank(En(ℚ)) = 0. Selmer groups can be determined by the data of locally solvability conditions of the homogenous spaces of elliptic curves Enand. The next step is to organize the data into carefully constructed graphs so that the Selmer groups have minimum if and only if the graphs have specific "odd" property. By a result in algebraic graph theory, an odd graph can be described by the rank of the Laplace matrix of the graph over 𝔽2. Thus, by computing the rank of a certain matrix over 𝔽2, we can determine allsuch that Snandhave minimum, in which caseis a non-congruent number. After explaining this method and related concepts, we describe the results on new series of non-congruent numbers obtained in this way and illustrate them by examples.