检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]Department of Mathematical Sciences
出 处:《Tsinghua Science and Technology》2003年第5期553-556,共4页清华大学学报(自然科学版(英文版)
基 金:Supported by the National Natural Science Foundationof China(No.196 2 5 10 2 ) and partially by the National"973"Project of China
摘 要:This paper shows a connection between exponential sums and character sums. In particular, we introduce a character sum that is an analog of the classical Kloosterman sums and establish the analogous Weil-Estermann's upper bound for it. The paper also analyzes a generalized Hardy-Littlewood example for character sums, which shows that the upper bounds given here are the best possible. The analysis makes use of local bounds for the exponential sums and character sums. The basic theorems have been previously established.This paper shows a connection between exponential sums and character sums. In particular, we introduce a character sum that is an analog of the classical Kloosterman sums and establish the analogous Weil-Estermann's upper bound for it. The paper also analyzes a generalized Hardy-Littlewood example for character sums, which shows that the upper bounds given here are the best possible. The analysis makes use of local bounds for the exponential sums and character sums. The basic theorems have been previously established.
关 键 词:exponential sums character sums Kloosterman sums
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38