Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 88 tok/s
Gemini 2.5 Pro 40 tok/s Pro
GPT-5 Medium 34 tok/s
GPT-5 High 36 tok/s Pro
GPT-4o 84 tok/s
GPT OSS 120B 463 tok/s Pro
Kimi K2 191 tok/s Pro
2000 character limit reached

Burgess bounds for multi-dimensional short mixed character sums (1404.6994v2)

Published 28 Apr 2014 in math.NT

Abstract: This paper proves Burgess bounds for short mixed character sums in multi-dimensional settings. The mixed character sums we consider involve both an exponential evaluated at a real-valued multivariate polynomial, and a product of multiplicative Dirichlet characters. We combine a multi-dimensional Burgess method with recent results on multi-dimensional Vinogradov Mean Value Theorems for translation-dilation invariant systems in order to prove character sum bounds in any dimension that recapture the Burgess bound in dimension 1. Moreover, we show that by embedding the given polynomial into an advantageously chosen translation-dilation invariant system constructed in terms of that polynomial, we may in many cases significantly improve the bound for the associated character sum, due to a novel phenomenon that occurs only in dimensions two and higher.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

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

Authors (1)

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube