Counting solvable S-unit equations

2020/07/30 by Igor E. Shparlinski, Shparlinski, I. E., C. L. Stewart +1
Mathematics · #Algebraic Geometry and Number Theory #Analytic Number Theory Research #FOS: Mathematics #Limits and Structures in Graph Theory #Number Theory (math.NT)

paper · pdf · doi:10.48550/arxiv.2007.15170

openalex publication_date 2020/07/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We obtain upper bounds on the number of finite sets \mathcal S of primes below a given bound for which various 2 variable \mathcal S-unit equations have a solution.

Citations

• On the distribution of multiplicatively dependent vectors

Related

• Two S-unit equations with many solutions
• Many solutions to the S-unit equation a+1=c
• On finding many solutions to S-unit equations by solving linear\n equations on average
• Counting solvable \mathcal S-unit equations and linear recurrence sequences with zeros
• Effective S-unit Equations Beyond 3 Terms : Newman's Conjecture