We classify those finite simple groups whose Brauer graph (or decomposition matrix) has a p-block with defect 0, completing an investigation of many authors. The only finite simple groups whose… Expand

In 1918 Polya and Vinogradov gave an upper bound for the maximal size of character sums, which still remains the best known general estimate. One of the main results of this paper provides a… Expand

We show several consequences of the abc-conjecture for questions in analytic number theory which were of interest to Paul Erd} os: For any given polynomial f(x) 2 Zx], we deduce, from the… Expand

er. We shall see how their legacy has inuenced research for most of the rest of the century, particularly through the 'schools' of Selberg, and of Erdos, and with the \large sieve" in the sixties.… Expand

Improving on a result of J.E. Littlewood, N. Levinson [3] showed that there are arbitrarily large t for which |ζ(1 + it)| ≥ e log2 t + O(1). (Throughout ζ(s) is the Riemann-zeta function, and logj… Expand

We give a relatively easy proof of the Erd ˝ os-Kac theorem via computing moments. We show how this proof extends naturally in a sieve theory context, and how it leads to several related results in… Expand