scholarly journals POINTS ON HYPERBOLAS AT RATIONAL DISTANCE

2012 ◽  
Vol 08 (04) ◽  
pp. 911-922
Author(s):  
EDRAY HERBER GOINS ◽  
KEVIN MUGO

Richard Guy asked for the largest set of points which can be placed in the plane so that their pairwise distances are rational numbers. In this article, we consider such a set of rational points restricted to a given hyperbola. To be precise, for rational numbers a, b, c, and d such that the quantity D = (ad - bc)/(2a2) is defined and non-zero, we consider rational distance sets on the conic section axy + bx + cy + d = 0. We show that, if the elliptic curve Y2 = X3 - D2X has infinitely many rational points, then there are infinitely many sets consisting of four rational points on the hyperbola such that their pairwise distances are rational numbers. We also show that any rational distance set of three such points can always be extended to a rational distance set of four such points.

2018 ◽  
Vol 25 (01) ◽  
pp. 133-138
Author(s):  
Xia Wu ◽  
Yan Qin

Let E be an elliptic curve defined over the field of rational numbers ℚ. Let d be a square-free integer and let Ed be the quadratic twist of E determined by d. Mai, Murty and Ono have proved that there are infinitely many square-free integers d such that the rank of Ed(ℚ) is zero. Let E(k) denote the elliptic curve y2 = x3 + k. Then the quadratic twist E(1)d of E(1) by d is the elliptic curve [Formula: see text]. Let r = 1, 2, 5, 10, 13, 14, 17, 22. Ono proved that there are infinitely many square-free integers d ≡ r (mod 24) such that rank [Formula: see text], using the theory of modular forms. In this paper, we use the class number of quadratic field and Pell equation to describe these square-free integers k such that E(k3)(ℚ) has rank zero.


1951 ◽  
Vol 3 ◽  
pp. 187-194 ◽  
Author(s):  
L. M. Kelly

With each set of points S of a distance space there is associated a set of non-negative real munbers D(S) called the distance set of 5. The number x is an element of D(S) if and only if x is a distance between some pair of points of 5. The number zero is always an element of any distance set and no two distinct elements are equal.


2010 ◽  
Vol 53 (1) ◽  
pp. 87-94
Author(s):  
Dragos Ghioca

AbstractWe prove that the group of rational points of a non-isotrivial elliptic curve defined over the perfect closure of a function field in positive characteristic is finitely generated.


Author(s):  
Viliam Ďuriš ◽  
Timotej Šumný

In the modern theory of elliptic curves, one of the important problems is the determination of the number of rational points on an elliptic curve. The Mordel–Weil theorem [T. Shioda, On the Mordell–Weil lattices, Comment. Math. University St. Paul. 39(2) (1990) 211–240] points out that the elliptic curve defined above the rational points is generated by a finite group. Despite the knowledge that an elliptic curve has a final number of rational points, it is still difficult to determine their number and the way how to determine them. The greatest progress was achieved by Birch and Swinnerton–Dyer conjecture, which was included in the Millennium Prize Problems [A. Wiles, The Birch and Swinnerton–Dyer conjecture, The Millennium Prize Problems (American Mathematical Society, 2006), pp. 31–44]. This conjecture uses methods of the analytical theory of numbers, while the current knowledge corresponds to the assumptions of the conjecture but has not been proven to date. In this paper, we focus on using a tangent line and the osculating circle for characterizing the rational points of the elliptical curve, which is the greatest benefit of the contribution. We use a different view of elliptic curves by using Minkowki’s theory of number geometry [H. F. Blichfeldt, A new principle in the geometry of numbers, with some applications, Trans. Amer. Math. Soc. 15(3) (1914) 227–235; V. S. Miller, Use of elliptic curves in cryptography, in Proc. Advances in Cryptology — CRYPTO ’85, Lecture Notes in Computer Science, Vol. 218 (Springer, Berlin, Heidelberg, 1985), pp. 417–426; E. Bombieri and W. Gubler, Heights in Diophantine Geometry, Vol. 670, 1st edn. (Cambridge University Press, 2007)].


2015 ◽  
Vol 145 (6) ◽  
pp. 1153-1182 ◽  
Author(s):  
Anne-Maria Ernvall-Hytönen ◽  
Kalle Leppälä ◽  
Tapani Matala-aho

Let 𝕀 denote an imaginary quadratic field or the field ℚ of rational numbers and let ℤ𝕀denote its ring of integers. We shall prove a new explicit Baker-type lower bound for a ℤ𝕀-linear form in the numbers 1, eα1, . . . , eαm,m⩾ 2, whereα0= 0,α1, . . . ,αmarem+ 1 different numbers from the field 𝕀. Our work gives substantial improvements on the existing explicit versions of Baker’s work about exponential values at rational points. In particular, dependencies onmare improved.


2017 ◽  
Vol 13 (07) ◽  
pp. 1881-1894 ◽  
Author(s):  
Jesse Patsolic ◽  
Jeremy Rouse

Given a quintic number field K/ℚ, we study the set of irreducible trinomials, polynomials of the form x5 + ax + b, that have a root in K. We show that there is a genus 4 curve CK whose rational points are in bijection with such trinomials. This curve CK maps to an elliptic curve defined over a number field, and using this map, we are able (in some cases) to determine all the rational points on CK using elliptic curve Chabauty.


2008 ◽  
Vol 04 (01) ◽  
pp. 15-23 ◽  
Author(s):  
S. TAKAHASHI

An elliptic curve defined over the field of rational numbers can be considered as a complex torus. We can describe its complex periods in terms of integration of the weight-2 cusp form corresponding to the elliptic curve. In this paper, we will study an analogous description of the p-adic periods of the elliptic curve, considering the elliptic curve as a p-adic torus. An essential tool for the proof of such a description is the level-lowering theorem of Ribet, which is one of the main ingredients used in the proof of Fermat's Last Theorem.


10.37236/8565 ◽  
2020 ◽  
Vol 27 (1) ◽  
Author(s):  
Ferenc Szöllősi ◽  
Patric R.J. Östergård

A finite set of vectors $\mathcal{X}$ in the $d$-dimensional Euclidean space $\mathbb{R}^d$ is called an $s$-distance set if the set of mutual distances between distinct elements of $\mathcal{X}$ has cardinality exactly $s$. In this paper we present a combined approach of isomorph-free exhaustive generation of graphs and Gröbner basis computation to classify the largest $3$-distance sets in $\mathbb{R}^4$, the largest $4$-distance sets in $\mathbb{R}^3$, and the largest $6$-distance sets in $\mathbb{R}^2$. We also construct new examples of large $s$-distance sets in $\mathbb{R}^d$ for $d\leq 8$ and $s\leq 6$, and independently verify several earlier results from the literature.


Sign in / Sign up

Export Citation Format

Share Document