Search

In this paper, we prove two results related to the solutions of norm form equations. Firstly, we give a finiteness result for sums of terms of linear recurrence sequences appearing in the coordinates of solutions of norm form equations. Next, we give a finiteness result concerning solutions of norm form equations representable as sums of $S$-units with a fixed number of terms. To prove these results, we use a deep results concerning the finiteness of the solutions of polynomial-exponential equations and $S$-unit equations., Comment: 12 pages. arXiv admin note: text overlap with arXiv:2403.18924

Let $(U_n)_{n\geq 0}$ be a non-degenerate linear recurrence sequence with order at least two defined over a function field and $\mathcal{O}_S^*$ be the set of $S$-units. In this paper, we use a result of Brownawell and Masser to prove effective results related to the Diophantine equations concerning linear recurrence sequences and $S$-units. In particular, we provide a finiteness result for the solutions of the Diophantine equation $U_{n_1} + \cdots + U_{n_r} \in \mathcal{O}_S^*$ in nonnegative integers $n_1, \ldots, n_r$. Furthermore, we study the finiteness result of the Diophantine equation $U_n+V_m+W_\ell = 0$ in $(n, m, \ell)\in \N^3$, where $U_n,V_m,W_\ell$ are simple linear recurrence sequences in the function field., Comment: 19 pages

Suppose that $(U_{n})_{n \geq 0}$ is a binary recurrence sequence and has a dominant root $\alpha$ with $\alpha>1$ and the discriminant $D$ is square-free. In this paper, we study the Diophantine equation $U_n + U_m = x^q$ in integers $n \geq m \geq 0$, $x \geq 2$, and $q \geq 2$. Firstly, we show that there are only finitely many of them for a fixed $x$ using linear forms in logarithms. Secondly, we show that there are only finitely many solutions in $(n, m, x, q)$ with $q, x\geq 2$ under the assumption of the {\em abc-conjecture}. To prove this, we use several classical results like Schmidt subspace theorem, a fundamental theorem on linear equations in $S$-units and Siegel's theorem concerning the finiteness of the number of solutions of a hyperelliptic equation., Comment: 20 pages

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 at least two. In this paper, we provide a finiteness result for the solutions of the Diophantine equation $aU_n + bU_m = z_1 +\cdots +z_r,$ where $n\geq m$ and $z_1, \ldots, z_r\in \mathcal{U}_S$., Comment: Comments are welcome

Let $S= \{ p_1, \ldots, p_s\}$ be a finite, non-empty set of distinct prime numbers and $(U_{n})_{n \geq 0}$ be a linear recurrence sequence of integers of order $r$. For any positive integer $k,$ we define $(U_j^{(k)})_{j\geq 1}$ an increasing sequence composed of integers of the form $U_{n_k} +\cdots + U_{n_1}, \ n_k>\cdots >n_1$. Under certain assumptions, we prove that for any $\epsilon >0,$ there exists an integer $n_{0}$ such that $[U_j^{(k)}]_S < \left(U_j^{(k)}\right)^{\epsilon},$ for $ j > n_0,$ where $[m]_S$ denote the $S$-part of the positive integer $m$. On further assumptions on $(U_{n})_{n \geq 0},$ we also compute an effective bound for $[U_j^{(k)}]_S$ of the form $\left(U_j^{(k)}\right)^{1-c}$, where $c $ is a positive constant depends only on $(U_{n})_{n \geq 0}$ and $S.$

In this paper, we consider the problem about finding out perfect powers in an alternating sum of consecutive cubes. More precisely, we completely solve the Diophantine equation $(x+1)^3 - (x+2)^3 + \cdots - (x + 2d)^3 + (x + 2d + 1)^3 = z^p$, where $p$ is prime and $x,d,z$ are integers with $1 \leq d \leq 50$.

Let $\{ {U_{n}\}_{n \geq 0} }$ be a non-degenerate binary recurrence sequence with positive discriminant. Let $\{p_1,\ldots, p_s\}$ be fixed prime numbers and $\{b_1,\ldots ,b_s\}$ be fixed non-negative integers. In this paper, we obtain the finiteness result for the solution of the Diophantine equation $U_{n_{1}} + \cdots + U_{n_{t}} = b_1 p_1^{z_1} + \cdots+ b_s p_s^{z_s} $ under certain assumptions. Moreover, we explicitly solve the equation $F_{n_1}+ F_{n_2}= 2^{z_1} +3^{z_2}$, in non-negative integers $n_1, n_2, z_1, z_2$ with $z_2\geq z_1$. The main tools used in this work are the lower bound for linear forms in logarithms and the Baker-Davenport reduction method., Comment: 16 pages

Let $\{u_{n}\}_{n \geq 0}$ be a non-degenerate binary recurrence sequence with positive, square-free discriminant and $p$ be a fixed prime number. In this paper, we have shown the finiteness result for the solutions of the Diophantine equation $u_{n_{1}} + u_{n_{2}} + \cdots + u_{n_{t}} = p^{z}$ with some conditions on $n_i $ for all $1\leq i \leq t$. Moreover, we explicitly find all the powers of three which are sums of three balancing numbers using the lower bounds for linear forms in logarithms. Further, we use a variant of Baker-Davenport reduction method in Diophantine approximation due to Dujella and Peth\H{o}., Comment: 15 pages

In this paper we have computed all the affine Kac-Moody symmetric spaces which are tame Frechet manifolds starting from the Vogan diagrams related to the affine untwisted Kac-Moody algebras. The detail computation of affine Kac-Moody symmetric spaces associated with A_1^(1) and A_2^(1) are shown algebraically to corroborate our method., Comment: preliminary version