相关论文: A Note on P\'epin's counter examples to the Hasse …

We prove a Hasse principle for solving equations of the form ax+by+cz=0 where x, y, z belong to a given finite index subgroup of the multiplicative group of rational numbers. From this we deduce a Hasse principle for diagonal curves over…

For the positive integer $n$, let $f(n)$ denote the number of positive integer solutions $(n_1, n_2, n_3)$ of the Diophantine equation $$ {4\over n}={1\over n_1}+{1\over n_2}+{1\over n_3}. $$ For the prime number $p$, $f(p)$ can be split…

We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, consider the following: (I) Given a polynomial f in Z[v,x,y], decide the sentence \exists v \forall x \exists y f(v,x,y)=0,…

Let $C$ be a smooth genus one curve described by a quartic polynomial equation over the rational field $\mathbb Q$ with $P\in C(\mathbb Q)$. We give an explicit criterion for the divisibility-by-$2$ of a rational point on the elliptic curve…

We show that the Diophantine problem(decidability of equations) is undecidable in free associative algebras over any field and in the group algebras over any field of a wide variety of torsion free groups, including toral relatively…

For any given positive definite binary quadratic form $Q$ with integer coefficients, we establish two results on Diophantine approximation with integers represented by $Q$. Firstly, we show that for every irrational number $\alpha$, there…

We prove the following result which was conjectured by Stichtenoth and Xing: let $g$ be the genus of a projective, irreducible non-singular curve over the finite field $\Bbb F_{q^2}$ and whose number of $\Bbb F_{q^2}$-rational points…

In this paper, we determine the primitive solutions of the Diophantine equation $(x-d)^2+x^2+(x+d)^2=y^n$ when $n\geq 2$ and $d=p^b$, $p$ a prime and $p\leq 10^4$. The main ingredients are the characterization of primitive divisors on…

Myasnikov, Ushakov, and Won introduced power circuits in 2012 to construct a polynomial-time algorithm for the word problem in the Baumslag group, which has a non-elementary Dehn function. Power circuits are computational structures that…

For a pair of quadratic forms with rational coefficients in at least $10$ variables, we prove an asymptotic formula for the number of common zeros under the assumption that the two forms determine a projective variety with exactly two…

We give solutions of a Diophantine equation containing factorials, which can be written as a cubic form, or as a sum of binomial coefficients. We also give some solutions to higher degree forms and relate some solutions to an unsolvable…

We study the ``imaginary" binary quadratic form equations ax^2+bxy+cy^2+g=0 over k[t] in rational function fields, showing that a condition with respect to the Artin reciprocity map, is the only obstruction to the local-global principle for…

We show how the exceptional isogenies of classical groups to orthogonal groups of quadratic spaces of dimensions up to 8 over fields of characteristic different from 2 may be obtained by explicit algebraic constructions using the…

We prove a generalization of W.M. Schmidt's theorem related to the Diophantine approximations for a linear form of the type $\alpha_1x_1+\alpha_2x_2 +y$ with {\it positive} integers $x_1,x_2$.

In this paper we continue the study of group representations which are counterexamples to the Ize conjecture. As in the previous papers by Lauterbach [14] and Lauterbach & Matthews [15] we find new infinite series of finite groups leading…

We study systems of polynomial equations in several classes of finitely generated rings and algebras. For each ring $R$ (or algebra) in one of these classes we obtain an interpretation by systems of equations of a ring of integers $O$ of a…

Let $k \geq 1$ be a cube-free integer with $k \equiv 1 \pmod {9}$ and $\gcd(k, 7\cdot 571)=1$. In this paper, we prove the existence of infinitely many triples of imaginary quadratic fields $\mathbb{Q}(\sqrt{d})$, $\mathbb{Q}(\sqrt{d+1})$…

For a finitely generated group $G$, the \emph{Diophantine problem} over $G$ is the algorithmic problem of deciding whether a given equation $W(z_1,z_2,\ldots,z_k) = 1$ (perhaps restricted to a fixed subclass of equations) has a solution in…

The positive existential theories of the sets $M_n(\mathbb N)$ without parameters build an inclusion lattice isomorhic with the lattice of divisibility. All these sets are algorithmically undecidable. In further sections some easier…

Using the Thue-Siegel method, we obtain effective improvements on Liouville's irrationality measure for certain one-parameter families of algebraic numbers, defined by equations of the type $(t-a)Q(t)+P(t)=0$. We apply these to some…