Counting solvable S-unit equations and linear recurrence sequences with zeros

DOI10.1090/PROC/17545MaRDI QIDQ7262002zbMATH OpenFDO

Authors Alina Ostafe, Carl Pomerance, Igor E. Shparlinski

Publication date 10 June 2026

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

Full work available at URL https://doi.org/10.1090/PROC/17545

zbMATH Keywords

\(\mathcal{S}\)-unitsfinitely generated groupslinear equationslinear recurrence sequenceszeros

Mathematics Subject Classification ID

Recurrences (11B37) Counting solutions of Diophantine equations (11D45) Exponential Diophantine equations (11D61)

Cites work

• A positive proportion of Thue equations fail the integral Hasse principle
• Carmichael's lambda function
• Counting solvable \(S\)-unit equations
• Effective results and methods for Diophantine equations over finitely generated domains
• How often does the Hasse principle hold?
• scientific article; zbMATH DE number 1973372 (Why is no real title available?)
• scientific article; zbMATH DE number 2121181 (Why is no real title available?)
• Multiplicative dependence in linear recurrence sequences
• Number fields
• ON PERFECT POWERS IN LINEAR RECURRENCE SEQUENCES OF INTEGERS
• On the normal number of prime factors of \(p - 1\) and some related problems concerning Euler's \(\varphi\)-function.
• On the zeros of linear recurrence sequences
• Opera de cribro
• Random Thue and Fermat equations
• Solubility of Fermat equations
• The Hasse principle for random Fano hypersurfaces
• The local solubility for homogeneous polynomials with random coefficients over thin sets
• The number of varieties in a family which contain a rational point

This page was built for publication: Counting solvable \(\mathcal{S}\)-unit equations and linear recurrence sequences with zeros

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