相关论文: A simple practical higher descent for large height…

In this paper we consider Diophantine equation x4 + y4 = z4 + w4 (1)We construct some family of cubic curves.We prove that every rational point on Quar- tica x4 + y4 = z4 + w4 can be mapped to a point on some curve of this family. We also…

Let X be the graph in the plane of a pfaffian function f (in the sense of Khovanskii). Suppose X is not algebraic. This note gives an upper bound for the number of rational points on X of height up to X. The bound is uniform in the order…

Let $C$ be a hyperelliptic curve over $\mathbb Q$ described by $y^2=a_0x^n+a_1x^{n-1}+\ldots+a_n$, $a_i\in\mathbb Q$. The points $P_{i}=(x_{i},y_{i})\in C(\mathbb{Q})$, $i=1,2,...,k,$ are said to be in a geometric progression of length $k$…

In this work, we consider the rational points on elliptic curves over finite fields F_{p}. We give results concerning the number of points on the elliptic curve y^2{\equiv}x^3+a^3(mod p)where p is a prime congruent to 1 modulo 6. Also some…

In characteristic $p>0$ and for $q$ a power of $p$, we compute the number of nonplanar rational curves of arbitrary degrees on a smooth Hermitian surface of degree $q+1$ under the assumption that the curves have a parametrization given by…

By the famous ADE classification rational double points are simple. Rational triple points are also simple. We conjecture that the simple normal surface singularities are exactly those rational singularities, whose resolution graph can be…

We design and analyze an algorithm for computing rational points of hypersurfaces defined over a finite field based on searches on "vertical strips", namely searches on parallel lines in a given direction. Our results show that, on average,…

We describe a practical algorithm for computing Brauer-Manin obstructions to the existence of rational points on hyperelliptic curves defined over number fields. This offers advantages over descent based methods in that its correctness does…

For a given genus $g \geq 1$, we give lower bounds for the maximal number of rational points on a smooth projective absolutely irreducible curve of genus $g$ over ${\mathbb F}_q$. As a consequence of Katz-Sarnak theory, we first get for any…

We find upper and lower bounds on the number of rational points that are $\psi$-approximations of some $n$-dimensional $p$-adic integer. Lattice point counting techniques are used to find the upper bound result, and a Pigeon-hole principle…

Based on a result by Taylor, Hendrickx, and Glineur (J. Optim. Theory Appl., 178(2):455--476, 2018) on the attainable convergence rate of gradient descent for smooth and strongly convex functions in terms of function values, an elementary…

In this note, we investigate the measure of singular sets and critical sets of real-valued solutions of elliptic equations in two dimensions. These singular sets and critical sets are finitely many points in the plane. Adapting the Carleman…

If an integer $n$ is written as a sum of two biquadrates in two different ways, then the elliptic curve $y^2=x^3-nx$ has rank $\geq 3$. If moreover $n$ is odd and the parity conjecture is true, then it has even rank $\geq 4$. Finally, some…

A fundamental problem in arithmetic geometry is to determine the image of the mod $N$ Galois representation for all elliptic curves over $\mathbb{Q}$ and integers $N \geq 1$. For a given subgroup $G \le…

We find the primitive integer solutions to x^2+y^3=z^7. A nonabelian descent argument involving the simple group of order 168 reduces the problem to the determination of the set of rational points on a finite set of twists of the Klein…

A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…

Let $\mathbb{F}_q$ denote a finite field of characteristic $p \geq 5$ and let $d = q+1$. Let $E_d$ denote the elliptic curve over the function field $\mathbb{F}_{q^2}(t)$ defined by the equation $y^2 + xy - t^d y = x^3$. Its rank is $q$…

We split the program of explicit descent of elliptic curves into two parts. For $n=3$ and $n=5,$ we first display a model for the universal elliptic curve $E$ with full level $n$ structure and describe the map of rational points of $E$ to…

We consider the problem of maximizing a convex function over a closed convex set in a real Hilbert space. For linear functions, we show that a single orthogonal projection suffices to obtain an approximate solution. For continuous convex…

We give a classification of all possible $2$-adic images of Galois representations associated to elliptic curves over $\mathbb{Q}$. To this end, we compute the 'arithmetically maximal' tower of 2-power level modular curves, develop…