Dirichlet character sums (Q4248993)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1300455
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dirichlet character sums |
scientific article; zbMATH DE number 1300455 |
Statements
Dirichlet character sums (English)
0 references
22 February 2000
0 references
0.8219456076622009
0 references
0.8188027739524841
0 references
0.8127233386039734
0 references
Let \(\chi\) be a Dirichlet character of conductor \(p^n\) with \(p \in {\mathbb{P}}\), \(n \in {\mathbb{N}}\), and let \(f(x) = a_0 + a_1 x + \cdots + a_k x^k\) be an integral polynomial such that \(k>3\) and \((p^n,a_1,\ldots,a_k)= p^m\). Using a special iteration the author proves some general character sum estimates of type \[ p^{-(n-m)(1-1/k)} \Big |\sum_{0 \leq x < p^{n-m}} \chi(f(x)) \Big |\leq \begin{cases} 1 &\text{if } p \geq (k-1)^{2k/(k-2)}\\ k & \text{ otherwise}\end{cases}. \]
0 references