Related papers: Diophantine problems over $\mathbb{Z}^{ab}$ modulo…
This paper introduces a framework to study discrete optimization problems which are parametric in the following sense: their constraint matrices correspond to matrices over the ring $\mathbb{Z}[x]$ of polynomials in one variable. We…
We give an algorithm to compute representatives of the conjugacy classes of semisimple square integral matrices with given minimal and characteristic polynomials. We also give an algorithm to compute the $\mathbb{F}_q$-isomorphism classes…
In this paper we show that Diophantine problem for quadratic equations in Baumslag-Solitar groups $BS(1,k)$ and in wreath products $A \wr \mathbb{Z}$, where $A$ is a finitely generated abelian group and $\mathbb{Z}$ is an infinite cyclic…
We study the solutions of a Diophantine equation of the form $a^x+b^y=c^z$, where $a\equiv 2 \pmod 4$, $b\equiv 3 \pmod 4$ and $\gcd (a,b,c)=1$. The main result is that if there exists a solution $(x,y,z)=(2,2,r)$ with $r>1$ odd then this…
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…
What are all rings $R$ for which $R^*$ (the group of invertible elements of $R$ under multiplication) is an elementary abelian $p$-group? We answer this question for finite-dimensional commutative $k$-algebras, finite commutative rings,…
In this article, I study and solve the exponential Diophantine equation $M_p^{x} + (M_q + 1)^{y}= (lz)^2$ where $M_p$ and $M_q$ are Mersenne primes, $l$ is a prime number, and $x,y$, and $z$ are non-negative integers. Several illustrations…
A recursive algorithm is constructed which finds all solutions to a class of Diophantine equations connected to the problem of determining ordered n-tuples of positive integers satisfying the property that their sum is equal to their…
Let $s(n)$ be the number of nonzero bits in the binary digital expansion of the integer $n$. We study, for fixed $k,\ell,m$, the Diophantine system $$ s(ab)=k, \quad s(a)=\ell,\quad \mbox{and }\quad s(b)=m, $$ in odd integer variables…
We investigate the solvability of the Diophantine equation $x^2-my^2=\pm p$ in integers for certain integer $m$ and prime $p$. Then we apply these results to produce family of maximal real subfield of a cyclotomic field whose class number…
A finite abelian $p$-group having an automorphism $x$ such that $1+\ldots+x^{p-1}=0$, can be viewed as a module over an appropriate discrete valuation ring $\mathcal{O}$ containing $\mathbb{Z}_p$ (the ring of $p$-adic integer). This yields…
A classification of multiplication modules over multiplication rings with finitely many minimal primes is obtained. A characterisation of multiplication rings with finitely many minimal primes is given via faithful, Noetherian, distributive…
It is proved that for any finite dimensional representation of a prime order group over the field of rational numbers, polynomial invariants of degree at most $3$ separate the orbits. A result providing an upper degree bound for separating…
Using the modular method, we study solutions to the Diophantine equation $$Aa^p+Bb^p=Cc^2$$ over number fields. We first prove an asymptotic result for general number fields satisfying an appropriate $S$-unit condition by assuming some…
We give criteria of the solvability of the diophantine equation $p=x^2+ny^2$ over some imaginary quadratic fields where $p$ is a prime element. The criteria becomes quite simple in special cases.
A famous problem posed by Diophantus was to find sets of distinct positive rational numbers such that the product of any two is one less than a rational square. Some sets of six such numbers are presented and the computational algorithm…
We design efficient algorithms to evaluate modular equations of Siegel and Hilbert type for abelian surfaces over number fields or finite fields using complex approximations. Their output is provably correct when the associated graded ring…
Let $S := \{p_1,\ldots ,p_{\ell}\}$ be a finite set of primes and denote by $\mathcal{U}_S$ the set of all rational integers whose prime factors are all in $S$. Let $(U_n)_{n\geq 0}$ be a non-degenerate linear recurrence sequence with order…
Hilbert's Tenth Problem (HTP) asks for an algorithm to test whether an arbitrary polynomial Diophantine equation with integer coefficients has solutions over the ring $\mathbb Z$ of the integers. This was finally solved by Matiyasevich…
We show that for infinitely many square-free integers q there exist infinitely many triples of rational numbers {a, b, c} such that a^2 + q, b^2 + q, c^2 + q, ab + q, ac + q and bc + q are squares of rational numbers.