Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Explicit values of multi-dimensional Kloosterman sums for prime powers, II
HTML articles powered by AMS MathViewer

by S. Gurak PDF
Math. Comp. 77 (2008), 475-493 Request permission

Abstract:

For any integer $m>1$ fix $\zeta _{m}=\textrm {exp}(2 \pi i/m)$, and let $\textbf {Z}_{m}^{*}$ denote the group of reduced residues modulo $m$. Let $q=p^{\alpha }$, a power of a prime $p$. The hyper-Kloosterman sums of dimension $n>0$ are defined for $q$ by \[ \displaylines { R(d,q)= \sum _{x_{1}, ..., x_{n} \in Z_{q}^{*}} \zeta _{q}^{x_{1}+ \cdots +x_{n} +d(x_{1} \cdots x_{n})^{-1}} \;\;\;\;\;\; (d \in \textbf {Z}_{q}^{*}), }\] where $x^{-1}$ denotes the multiplicative inverse of $x$ modulo $q$. Salie evaluated $R(d,q)$ in the classical setting $n=1$ for even $q$, and for odd $q=p^{\alpha }$ with $\alpha >1$. Later, Smith provided formulas that simplified the computation of $R(d,q)$ in these cases for $n>1$. Recently, Cochrane, Liu and Zheng computed upper bounds for $R(d,q)$ in the general case $n >0$, stopping short of their explicit evaluation. Here I complete the computation they initiated to obtain explicit values for the Kloosterman sums for $\alpha >1$, relying on basic properties of some simple specialized exponential sums. The treatment here is more elementary than the author’s previous determination of these Kloosterman sums using character theory and $p$-adic methods. At the least, it provides an alternative, independent evaluation of the Kloosterman sums.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2000): 11L05, 11T24
  • Retrieve articles in all journals with MSC (2000): 11L05, 11T24
Additional Information
  • S. Gurak
  • Affiliation: Department of Mathematics, University of San Diego, San Diego, California 92110
  • Received by editor(s): May 10, 2006
  • Received by editor(s) in revised form: November 8, 2006
  • Published electronically: May 14, 2007

  • Dedicated: In memory of Derick H. Lehmer
  • © Copyright 2007 American Mathematical Society
    The copyright for this article reverts to public domain 28 years after publication.
  • Journal: Math. Comp. 77 (2008), 475-493
  • MSC (2000): Primary 11L05, 11T24
  • DOI: https://doi.org/10.1090/S0025-5718-07-02011-X
  • MathSciNet review: 2353962