Papers
Topics
Authors
Recent
Search
2000 character limit reached

Pretentiously detecting power cancellation

Published 8 Nov 2011 in math.NT | (1111.1921v1)

Abstract: Granville and Soundararajan have recently introduced the notion of pretentiousness in the study of multiplicative functions of modulus bounded by 1, essentially the idea that two functions which are similar in a precise sense should exhibit similar behavior. It turns out, somewhat surprisingly, that this does not directly extend to detecting power cancellation - there are multiplicative functions which exhibit as much cancellation as possible in their partial sums that, modified slightly, give rise to functions which exhibit almost as little as possible. We develop two new notions of pretentiousness under which power cancellation can be detected, one of which applies to a much broader class of multiplicative functions.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.