Related papers: Markoff-Rosenberger triples and generalized Lucas …

For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…

In this paper, we study the Brezis-Nirenberg type problem for Choquard equations in $\mathbb{R}^N$ \begin{equation*} -\Delta u+u=(I_{\alpha}\ast|u|^{p})|u|^{p-2}u+\lambda|u|^{q-2}u \quad \mathrm{in}\ \mathbb{R}^N, \end{equation*} where…

Using only elementary arguments, Cassels solved the Diophantine equation $(x-1)^3+x^3+(x+1)^3=z^2$ in integers $x$, $z$. The generalization $(x-1)^k+x^k+(x+1)^k=z^n$ (with $x$, $z$, $n$ integers and $n \ge 2$) was considered by Zhongfeng…

This paper presents new identities expressing the terms of Fibonacci, Lucas, and generalized Fibonacci sequences with multiple indices through powers of Lucas numbers and binomial coefficients. The obtained formulas rely on the application…

We solve the Diophantine equation $Y^2=X^3+k$ for all nonzero integers $k$ with $|k| \leq 10^7$. Our approach uses a classical connection between these equations and cubic Thue equations. The latter can be treated algorithmically via lower…

Given a sequence of Marcinkiewicz-Zygmund inequalities in $L^2$, we derive approximation theorems and quadrature rules. The derivation is completely elementary and requires only the definition of Marcinkiewicz-Zygmund inequality, Sobolev…

In this article, we consider the Diophantine equation $\sigma_{2}(n)-n^2=An+B$ with $A=P^2\pm2$. For some $B$, we show that except for finitely many computable solutions in the range $n\leq(|A|+|B|)^{3}$, all the solutions are expressible…

This paper is devoted to the study of normalized solutions to the Kirchhoff type equation with a logarithmic perturbation\[-\left(a+b\int_{\mathbb{R}^3}|\nabla u|^2 \,\mathrm{d}x \right) \Delta u=\lambda u+|u|^{p-2}u+u\log u^2,\quad x…

Let $\{U_n\}_{n\geq 0}$ be a Lucas sequence. Then the equation $$|U_n|=m_1!m_2!\cdots m_k!$$ with $1<m_1\leq m_2\leq \cdots\leq m_k$ implies $n\in \{1,2, 3, 4, 6, 8, 12\}$. Further the equation $$|U_n|=D_{m_1}D_{m_2}\cdots D_{m_k}, \qquad…

In this paper we settle long-standing questions regarding the combinatorial complexity of Minkowski sums of polytopes: We give a tight upper bound for the number of faces of a Minkowski sum, including a characterization of the case of…

Solving a Radon-Kaczmarz puzzle involves filling a square grid with positive integers, each between one and nine, satisfying certain clues coming from the sum of entries that lie on the same line in the square grid. Given a set of slopes…

We find all solutions to the parametrized family of norm-form equations $x^3-(t^3-1)y^3+3(t^3-1)xy+(t^3-1)^2 = \pm 1$ studied by Amoroso, Masser and Zannier. Our proof relies upon an appeal to lower bounds for linear forms in logarithms and…

We give improved lower bounds for the number of solutions of some $S$-unit equations over the integers, by counting the solutions of some associated linear equations as the coefficients in those equations vary over sparse sets. This method…

This paper finds all Lucas numbers which are the sum of two Jacobsthal numbers. It also finds all Jacobsthal numbers which are the sum of two Lucas numbers. In general, we find all non-negative integer solutions $(n, m, k)$ of the two…

We explore a generalization of the Markov numbers that is motivated by a specific generalized cluster algebra arising from an orbifold, in the sense of Chekhov and Shapiro. We give an explicit algorithm for computing these generalized…

We classify all solution triples with Fibonacci components to the equation $a^2+b^2+c^2=3abc+m,$ for positive $m$. We show that for $m=2$ they are precisely $(1,F(b),F(b+2))$, with even $b$; for $m=21$, there exist exactly two Fibonacci…

Let K be a field of characteristic 0 and let n be a natural number. Let Gamma be a subgroup of the multiplicative group $(K^\ast)^n$ of finite rank r. Given $A_2,...,a_n\in K^\ast$ write $A(a_1,...,a_n,\Gamma)$ for the number of solutions…

A conjecture of N. Terai states that for any integer $k>1$, the equation $x^2+(2k-1)^y =k^z$ has only one solution, namely, $(x, y, z) = (k-1, 1, 2).$ Using the structure of class groups of binary quadratic forms, we prove the conjecture…

Lucas polynomials are polynomials in $s_1$ and $s_2$ defined recursively by $\{0\}=0$, $\{1\}=1$, and $\{m\}=s_1\{m-1\}+s_2\{m-2\}$ for $m \geq 2$. We generalize Lucas polynomials from 2-variable polynomials to multivariable polynomials.…

We conjecture an integrability and linearizability test for dispersive Z^2-lattice equations by using a discrete multiscale analysis. The lowest order secularity conditions from the multiscale expansion give a partial differential equation…