Integers representable as differences of linear recurrence sequences

DOI10.1007/S40993-021-00252-2zbMATH Open1473.11079arXiv2008.00844OpenAlexW3139325539MaRDI QIDQ2020008FDOQ2020008

Ingrid Vukusic, Volker Ziegler, Daodao Yang, Robert F. Tichy

Publication date: 23 April 2021

Published in: Research in Number Theory (Search for Journal in Brave)

Abstract: Let ${U_n}_{ngeq0}$ and ${V_m}_{mgeq0}$ be two linear recurrence sequences. We establish an asymptotic formula for the number of integers $c$ in the range $[-x,x]$ which can be represented as differences $U_n-V_m$. In particular, the density of such integers is $0$.

Full work available at URL: https://arxiv.org/abs/2008.00844

zbMATH Keywords

Diophantine equationsPillai's problemrecurrence sequence

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Exponential Diophantine equations (11D61) Counting solutions of Diophantine equations (11D45)

Cites Work

• Primary cyclotomic units and a proof of Catalans conjecture
• Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
• An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II
• Logarithmic forms and group varieties.
• Title not available (Why is that?)
• On a variant of Pillai's problem. II.
• On a problem of Pillai with Fibonacci numbers and powers of 2
• On a variant of Pillai’s problem
• ON PILLAI'S PROBLEM WITH TRIBONACCI NUMBERS AND POWERS OF 2

Cited In (3)

• On the difference of perfect powers and sums of terms of linear recurrences
• On Pillai’s problem with X-coordinates of Pell equations and powers of 2 II
• On a variant of Pillai's problem with transcendental numbers

This page was built for publication: Integers representable as differences of linear recurrence sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2020008)