Recursive Elucidation of Polynomial Congruences Using Root-Finding Numerical Techniques

In this paper we put forward a family of algorithms for lifting solutions of a polynomial congruencemod pto polynomial congruencemod pk. For this purpose, root-finding iterative methods are employed for solving polynomial congruences of the formaxn≡b(mod pk),k≥1,wherea,b,andn>0are integers which are not divisible by an odd primep. It is shown that the algorithms suggested in this paper drastically reduce the complexity for such computations to a logarithmic scale. The efficacy of the proposed technique for solving negative exponent equations of the formax-n≡b(mod pk)has also been addressed.

ON SOLUTIONS TO SOME POLYNOMIAL CONGRUENCES IN SMALL BOXES

We use bounds of mixed character sum to study the distribution of solutions to certain polynomial systems of congruences modulo a prime $p$. In particular, we obtain nontrivial results about the number of solutions in boxes with the side length below ${p}^{1/ 2} $, which seems to be the limit of more general methods based on the bounds of exponential sums along varieties.

SOLUTIONS TO POLYNOMIAL CONGRUENCES IN WELL-SHAPED SETS

We use a generalisation of Vinogradov’s mean value theorem of Parsell et al. [‘Near-optimal mean value estimates for multidimensional Weyl sums’, arXiv:1205.6331] and ideas of Schmidt [‘Irregularities of distribution. IX’, Acta Arith. 27 (1975), 385–396] to give nontrivial bounds for the number of solutions to polynomial congruences, when the solutions lie in a very general class of sets, including all convex sets.