On a Set of Congruences Related to Character Sums III (Q4024893)

[For Parts I, II, cf. J. Lond. Math. Soc., II. Ser. 37, 385-394 (1988; Zbl 0647.10026), Bull. Lond. Math. Soc. 22, 333-338 (1990; Zbl 0713.11056).] The author continues his investigations about the estimation of character sums: Let \(\chi\) be a primitive character to the prime power modulus \(p^ k\), and let \(h\) be an integer satisfying \(0<h\leq p^{k/6}\). Previously, it was shown by the author that if \(1\leq k\leq 6\) then \[ \sum_ \psi\;\sum_{\ell=0}^{p^ k-1} \bigl|\sum_{m=1}^ h \chi(\ell+m)\psi(\ell+m)\bigr|^ 8 \ll p^{2k}\cdot h^ 4, \] where \(\psi\) runs through all additive characters \(\mod p^ k\). The present paper extends this result to the case when \(k=7\). Further progress to higher values of \(k\) seems to be possible. The proof is based on a new estimate for the cardinality of a set of some congruences.