Counting solvable S-unit equations

DOI10.1090/PROC/15674MaRDI QIDQ5157787zbMATH OpenOpenAlexFDO

Authors Igor E. Shparlinski, C. L. Stewart

Publication date 20 October 2021

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

\(S\)-unit equationslinear forms in logarithms

Mathematics Subject Classification ID

Exponential Diophantine equations (11D61) Linear forms in logarithms; Baker's method (11J86)

Abstract: We obtain upper bounds on the number of finite sets $mathcalS$ of primes below a given bound for which various $2$ variable $mathcalS$-unit equations have a solution.

Recommendations

• On distribution of solutions of S-unit equations
• Two \(S\)-unit equations with many solutions
• Many solutions to the \(S\)-unit equation \(a+1=c\)
• An explicit upper bound for the number of solutions of the S-unit equation.
• scientific article; zbMATH DE number 653584

Cited in

(7)

• Many solutions to the \(S\)-unit equation \(a+1=c\)
• On the number of ABC solutions with restricted radical sizes
• scientific article; zbMATH DE number 4049714 (Why is no real title available?)
• On distribution of solutions of S-unit equations
• Counting solvable \(\mathcal{S}\)-unit equations and linear recurrence sequences with zeros
• Two \(S\)-unit equations with many solutions
• Counting the values taken by sums of S-units

This page was built for publication: Counting solvable \(S\)-unit equations

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