Search

Let $q$ be an integer. A $D(q)$-$m$-tuple is a set of $m$ distinct positive integers ${a_1, a_2, . . . , a_m}$ such that $a_ia_j + q$ is a perfect square for all $1 \leq i < j \leq m$. By counting integer solutions $x \in [1, b]$ of congruences $x^2 \equiv q (\mod b)$ with $b \leq N$, we count $D(q)$-pairs with both elements up to $N$, and give estimates on asymptotic behaviour. We show that for prime $q$, the number of such $D(q)$-pairs and $D(q)$-triples grows linearly with $N$. Up to a factor of $2$, the slope of this linear function is the quotient of the value of the $L$-function of an appropriate Dirichlet character (usually a Kronecker symbol) and of $\zeta(2)$., Comment: 20 pages

In this paper we improve on existing methods to compute quadratic points on modular curves and apply them to successfully find all the quadratic points on all modular curves $X_0(N)$ of genus up to $8$, and genus up to $10$ with $N$ prime, for which they were previously unknown. The values of $N$ we consider are contained in the set \[ \mathcal{L}=\{58, 68, 74, 76, 80, 85, 97, 98, 100, 103, 107, 109, 113, 121, 127 \}.\] We obtain that all the non-cuspidal quadratic points on $X_0(N)$ for $N\in \mathcal{L}$ are CM points, except for one pair of Galois conjugate points on $X_0(103)$ defined over $\mathbb{Q}(\sqrt{2885})$. We also compute the $j$-invariants of the elliptic curves parametrised by these points, and for the CM points determine their geometric endomorphism rings., Comment: Minor corrections, to appear in Mathematics of Computation. (25 pages, 16 tables)

We complete the computation of all $\mathbb{Q}$-rational points on all the $64$ maximal Atkin-Lehner quotients $X_0(N)^*$ such that the quotient is hyperelliptic. To achieve this, we use a combination of various methods, namely the classical Chabauty--Coleman, elliptic curve Chabauty, quadratic Chabauty, and the bielliptic quadratic Chabauty method combined with the Mordell-Weil sieve. Additionally, for square-free levels $N$, we classify all $\mathbb{Q}$-rational points as cusps, CM points (including their CM field and $j$-invariants) and exceptional ones. We further indicate how to use this to compute the $\mathbb{Q}$-rational points on all of their modular coverings., Comment: 29 pages, 6 tables; accepted by ANTS-XV and hence for publication in Research in Number Theory

We use the method of quadratic Chabauty on the quotients $X_0^+(N)$ of modular curves $X_0(N)$ by their Fricke involutions to provably compute all the rational points of these curves for prime levels $N$ of genus four, five, and six. We find that the only such curves with exceptional rational points are of levels $137$ and $311$. In particular there are no exceptional rational points on those curves of genus five and six. More precisely, we determine the rational points on the curves $X_0^+(N)$ for $N=137,173,199,251,311,157,181,227,263,163,197,211,223,269,271,359$., Comment: 25 pages. Comments are welcome

Let $k$ be a positive integer. In this paper, we prove that if $\{k,k+1,c,d\}$ is a $D(-k)$-quadruple with $c>1$, then $d=1$., Comment: 15 pages

A Diophantine $m$-tuple is a set of $m$ distinct integers such that the product of any two distinct elements plus one is a perfect square. In this paper we study the extensibility of a Diophantine triple $\{k-1, k+1, 16k^3-4k\}$ in Gaussian integers $\mathbb{Z}[i]$ to a Diophantine quadruple. Similar one-parameter family, $\{k-1, k+1, 4k\}$, was studied in Franu\v{s}i\'c's previous paper, where it was shown that the extension to a Diophantine quadruple is unique (with an element $16k^3-4k$). The family of the triples of the same form $\{k-1, k+1, 16k^3-4k\}$ was already studied in rational integers. It appeared as a special case while solving the extensibility problem of Diophantine pair $\{k-1, k+1\}$, in which it was not possible to use the same method as in the other cases. As authors (Bugeaud, Dujella and Mignotte) point out, the difficulty appears because the gap between $k+1$ and $16k^3-4k$ is not sufficiently large. We find the same difficulty here while trying to use Diophantine approximations. Then we partially solve this problem by using linear forms in logarithms., Comment: 24 pages

A Diophantine $m$-tuple is a set of $m$ distinct integers such that the product of any two distinct elements plus one is a perfect square. It was recently proven that there is no Diophantine quintuple in positive integers. We study the same problem in the rings of integers of imaginary quadratic fields. By using a gap principle proven by Diophantine approximations, we show that $m\leqslant 42$. Our proof is relatively simple compared to the proofs of the similar results in positive integers.

For a nonzero integer $n$, a set of distinct nonzero integers $\{a_1,a_2,\ldots,a_m\}$ such that $a_ia_j+n$ is a perfect square for all $1\leq i

Let $n$ be a nonzero integer. A set of $m$ positive integers is called a $D(n)$-$m$-tuple if the product of any two of its distinct elements increased by $n$ is a perfect square. Let $k$ be a positive integer. By elementary means, we show that the $D(-8k^2)$-pair $\{8k^2, 8k^2+1\}$ can be extended to at most a quadruple (the third and fourth element can only be $1$ and $32k^2+1$). At the end, we suggest considering a $D(-k^2)$-triple $\{ 1, 2k^2, 2k^2+2k+1\}$ as possible future research direction., Comment: partially presented at ELAZ 2016 conference (Strobl am Wolfgangsee, Austria)

Conjecturing formulas and other symbolic relations occurs frequently in number theory and combinatorics. If we could automate conjecturing, we could benefit not only from speeding up, but also from finding conjectures previously out of our grasp. Grammatical evolution, a genetic programming technique, can be used for automated conjecturing in mathematics. Concretely, this work describes how one can interpret the Frobenius problem as a symbolic regression problem, and then apply grammatical evolution to it. In this manner, a few formulas for Frobenius numbers of specific quadruples were found automatically. The sketch of the proof for one conjectured formula, using lattice point enumeration method, is provided as well. Same method can easily be used on other problems to speed up and enhance the research process., Comment: 8 pages, 2 tables; added a clear introduction, otherwise reduced text significantly