Abstract
We give improved lower bounds for the number of solutions of some -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 is quite conceptually straightforward, although its successful implementation involves, amongst other things, a slightly subtle use of a large sieve inequality. We also present two other results about solving linear equations on average over their coefficients.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.