中文
相关论文

相关论文: Diophantine Tuples over $\mathbb{Z}_p$

200 篇论文

This study investigates the existence of tuples $(k, \ell, m)$ of integers such that all of $k$, $\ell$, $m$, $k+\ell$, $\ell+m$, $m+k$, $k+\ell+m$ belong to $S(\alpha)$, where $S(\alpha)$ is the set of all integers of the form $\lfloor…

数论 · 数学 2023-01-04 Yuya Kanado , Kota Saito

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…

数论 · 数学 2019-05-24 Nikola Adžaga , Alan Filipin , Zrinka Franušić

Using the theory of Diophantine m-tuples, i.e. sets with the property that the product of its any two distinct elements increased by 1 is a perfect square, we construct an elliptic curve over Q(t) of rank at least 4 with three non-trivial…

数论 · 数学 2021-08-30 Andrej Dujella

A rational Diophantine m-tuple is a set of m nonzero rationals such that the product of any two of them increased by 1 is a perfect square. The first rational Diophantine quadruple was found by Diophantus, while Euler proved that there are…

数论 · 数学 2019-10-31 Andrej Dujella , Matija Kazalicki , Vinko Petričević

Suppose $n$ is the fundamental discriminant associated with a quadratic extension of $\mathbb{Q}$. We show that for every Diophantine $m$-tuple $ \{t_1, t_2, \ldots, t_m\} $ with the property $ D(n) $, there exists integral ideals $…

Let R be a recursive subring of a number field. We show that recursively enumerable sets are diophantine for the polynomial ring R[Z].

数论 · 数学 2008-09-11 Jeroen Demeyer

Let $d$ be a square-free integer and $\mathbb{Z}[\sqrt{d}]$ a quadratic ring of integers. For a given $n\in\mathbb{Z}[\sqrt{d}]$, a set of $m$ non-zero distinct elements in $\mathbb{Z}[\sqrt{d}]$ is called a Diophantine $D(n)$-$m$-tuple (or…

数论 · 数学 2024-06-27 Kalyan Chakraborty , Shubham Gupta , Azizul Hoque

A rational Diophantine m-tuple is a set of m nonzero rationals such that the product of any two of them increased by 1 is a perfect square. The first rational Diophantine quadruple was found by Diophantus, while Euler proved that there are…

数论 · 数学 2017-09-05 Andrej Dujella , Matija Kazalicki

Let $n$ be a nonzero integer. A set of nonzero integers $\{a_1,\ldots,a_m\}$ such that $a_ia_j+n$ is a perfect square for all $1\leq i<j\leq m$ is called a $D(n)$-$m$-tuple. In this paper, we consider the question, for given integer $n$…

数论 · 数学 2019-10-31 Andrej Dujella , Vinko Petričević

We consider Diophantine quintuples $\{a, b, c, d, e\}$. These are sets of distinct positive integers, the product of any two elements of which is one less than a perfect square. It is conjectured that there are no Diophantine quintuples; we…

数论 · 数学 2015-01-20 Tim Trudgian

A set of positive integers with the property that the product of any two of them is the successor of a perfect square is called Diophantine $D(-1)$--set. Such objects are usually studied via a system of generalized Pell equations naturally…

数论 · 数学 2022-01-26 Nicolae Ciprian Bonciocat , Mihai Cipu , Maurice Mignotte

We consider Diophantine quintuples $\{a, b, c, d, e\}$, sets of distinct positive integers the product of any two elements of which is one less than a perfect square. Triples of the first kind are the subsets $\{a, b, d\}$ with $d> b^{5}$.…

数论 · 数学 2015-02-27 Dave Platt , Tim Trudgian

We use a new argument to improve the error term in the asymptotic formula for the number of Diophantine $m$-tuples in finite fields, which is due to A. Dujella and M.Kazalicki (2021) and N. Mani and S. Rubinstein-Salzedo (2021).

数论 · 数学 2023-01-11 Igor E. Shparlinski

Let n be a nonzero integer and assume that a set S of positive integers has the property that xy+n is a perfect square whenever x and y are distinct elements of S. In this paper we find some upper bounds for the size of the set S. We prove…

数论 · 数学 2021-08-30 Andrej Dujella

A rational Diophantine m-tuple is a set of m nonzero rationals such that the product of any two of them increased by 1 is a perfect square. The first rational Diophantine quadruple was found by Diophantus, while Euler proved that there are…

Diophantine subsets of $\mathbb{Z}$ play a key role in the negative answer to Hilbert's tenth problem. The definition of diophantine set generalizes in several ways to other commutative rings. We compare these definitions. Along the way, we…

数论 · 数学 2025-11-25 Bhargav Bhatt , Bjorn Poonen

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…

数论 · 数学 2017-07-31 Nikola Adžaga , Alan Filipin

For a rational number $q$, a rational $D(q)$-$n$-tuple is a set of $n$ distinct nonzero rationals $\{a_1, a_2, \dots, a_n\}$ such that $a_ia_j+q$ is a rational square for all $1 \leqslant i < j \leqslant n$. For every $q$ we find all…

数论 · 数学 2025-12-30 Goran Dražić , Matija Kazalicki

Let $S$ denote a set of primes and let $a_1,\ldots,a_m$ be positive distinct integers. We call the $m$-tuple $(a_1,\ldots,a_m)$ an $S$-Diophantine tuple if $a_ia_j+1=s_{i,j}$ are $S$-integers for all $i\not=j$. In this paper, we show that…

数论 · 数学 2014-07-28 László Szalay , Volker Ziegler

For non-zero integers $n$ and $k\geq2$, a generalized Diophantine $m$-tuple with property $D_k(n)$ is a set of $m$ positive integers $S = \{a_1,a_2,\ldots, a_m\}$ such that $a_ia_j + n$ is a $k$-th power for $1\leq i< j\leq m$. Define…

数论 · 数学 2022-10-03 S. Bhattacharjee , A. B. Dixit , D. Saikia