A note on Hal\'asz's Theorem in Fq[t]

Abstract

In the setting of the integers, Granville, Harper and Soundararajan showed that the upper bound in Hal\'asz's Theorem can be improved for smoothly supported functions. We derive the analogous result for Hal\'asz's Theorem in Fq[t], and then consider the converse question of when the general upper bound in this version of Hal\'asz's Theorem is actually attained.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…