Dirichlet characters, Gauss sums and arithmetic Fourier transforms

In this paper, a general algorithm for the computation of the Fourier coefficients of 2π-periodic （continuous） functions is developed based on Dirichlet characters, Gauss sums and the generalized MSbius transform. It permits the direct extraction of the Fourier cosine and sine coefficients. Three special cases of our algorithm are presented. A VLSI architecture is presented and the error estimates are given.

On the 2k-th Power Mean of Inversion of L-functions with the Weight of the Gauss Sum

The main purpose of this paper is to use the estimate for character sums and the method of trigonometric sums to study the 2k-th power mean of the inversion of Dirichlet L-functions with the weight of the Gauss sums, and give a sharper asymptotic formula.

Gauss Sum of Index 4:(1)Cyclic Case

Let p be a prime, m ≥ 2, and （m,p（p - 1）） = 1. In this paper, we will calculate explicitly the Gauss sum G（X） = ∑x∈F＊qX（x）ζ^Tp^（x） in the case of [（Z/mZ）＊ ： （p）] = 4, and -1 （不属于） （p）, where q P^f, f =φ（m）/4, X is a multiplicative character of Fq with order m, and T is the trace map for Fq/Fp. Under the assumptions [（Z/mZ）＊ ： （p）] = 4 and 1（不属于） （p）, the decomposition field of p in the cyclotomic field Q（ζm） is an imaginary quartic （abelian） field. And G（X） is an integer in K. We deal with the case where K is cyclic in this oaDer and leave the non-cvclic case to the next paper.

Gauss Sum of Index 4:(2)Non-cyclic Case

Assume that m ≥ 2, p is a prime number, （m,p（p - 1）） = 1,-1 not belong to 〈p〉 belong to （Z/mZ）^＊ and [（Z/mZ）^＊：〈p〉]=4.In this paper, we calculate the value of Gauss sum G（X）=∑x∈F^＊x（x）ζp^T（x） over Fq,where q=p^f,f=φ（m）/4,x is a multiplicative character of Fq and T is the trace map from Fq to Fp.Under our assumptions,G（x） belongs to the decomposition field K of p in Q（ζm） and K is an imaginary quartic abelian unmber field.When the Galois group Gal（K/Q） is cyclic,we have studied this cyclic case in anotyer paper：＂Gauss sums of index four：（1）cyclic case＂（accepted by Acta Mathematica Sinica,2003）.In this paper we deal with the non-cyclic case.

The Gauss sums and Jacobi sums over Galois ring GR(p^2 , r)

Galois rings and exponential sums over Galois rings have many applications in algebraic combinatorics, coding theory and cryptography. In this paper, we present explicit description on the Gauss sums and Jacobi sums over Galois ring GR(p2 , r), and show that the values of these sums can be reduced to the Gauss sums and Jacobi sums over finite field Fpr for all non-trivial cases.

On the Mean Value of General k-th Gauss Sums

The main purpose of this paper is using residue system and character sums methods to investigate the mean value properties of general k-th Gauss sums,and two exact calculating formulas are given.

On the Fourth Power Mean of the Generalized Quadratic Gauss Sums

The main purpose of this paper is to use elementary methods and properties of the classical Gauss sums to study the computational problem of one kind of fourth power mean of the generalized quadratic Gauss sums mod q （a positive odd number）, and give an exact computational formula for it.

The First Power Mean of the Inversion of L-Functions Weighted by Quadratic Gauss Sums

The main purpose of this paper is to use estimates for character sums and analytic methods to study the first power mean of the inversion of Dirichlet L-functions with the weight of general quadratic Gauss sums,and three asymptotic formulae are obtained.

Cyclotomic problem, Gauss sums and Legendre curve

In this paper, explicit determination of the cyclotomic numbers of order l and 2l, for odd prime l ≡ 3 (mod 4), over finite field Fq in the index 2 case are obtained, utilizing the explicit formulas on the corresponding Gauss sums. The main results in this paper are related with the number of rational points of certain elliptic curve, called "Legendre curve", and the properties and value distribution of such number are also presented.

Sign or root of unity ambiguities of certain Gauss sums

Gauss sums play an important role in number theory and arithmetic geometry. The main objects of study in this paper are Gauss sums over the finite field with q elements. Recently, the problem of explicit evaluation of Gauss sums in the small index case has been studied in several papers. In the process of the evaluation, it is realized that a sign （or a root of unity） ambiguity unavoidably occurs. These papers determined the ambiguities by the congruences modulo L, where L is certain divisor of the order of Gauss sum. However, such method is unavailable in some situations. This paper presents a new method to determine the sign （root of unity） ambiguities of Gauss sums in the index 2 case and index 4 case, which is not only suitable for all the situations with q being odd, but also comparatively more efficient and uniform than the previous method.

Complete solving of explicit evaluation of Gauss sums in the index 2 case

Let p be a prime number,N be a positive integer such that gcd(N,p) = 1,q = pf where f is the multiplicative order of p modulo N.Let χ be a primitive multiplicative character of order N over finite field Fq.This paper studies the problem of explicit evaluation of Gauss sums G(χ) in the "index 2 case"(i.e.[(Z/NZ):【p】] = 2).Firstly,the classification of the Gauss sums in the index 2 case is presented.Then,the explicit evaluation of Gauss sums G(χλ)(1 λ N-1) in the index 2 case with order N being general even integer(i.e.N = 2r·N0,where r,N0 are positive integers and N0 3 is odd) is obtained.Thus,combining with the researches before,the problem of explicit evaluation of Gauss sums in the index 2 case is completely solved.

Gauss随机变量产生方法的比较研究

在通信系统仿真中,Gauss随机变量是最重要也是最常用到的随机变量。根据Gauss随机变量产生的基本原理,结合中心极限定理、坐标转换和概率分布的基本知识,分析了产生Gauss随机变量的三类方法,即12求和法、Box-Mull-er法和极坐标法,实现了Gauss随机变量的产生,比较了三种方法和直接使用函数产生Gauss随机变量的性能,提出了检验Gauss随机变量的易实现的三个参数-相对集中度、宽度对称度和相对宽度对称度,分析研究得出:12求和法产生的Gauss随机变量相对集中,Box-Muller法的统计特性、对称性等综合性能更优的结论。

关于Dirichlet L-函数与Gauss和

利用解析方法及其三角和估计给出DirichletL－函数二次加权均值的一个较强的渐近公式。

关于Gauss和的2k次均值

利用特征和估计及其三角和方法给出了Ｇａｕｓｓ 和τ（ χ）的２ｋ 次均值的一个精确的计算公式－

关于广义k次Gauss和及其四次均值(英文)

利用初等方法研究了广义k次Gauss和的四次均值,并给出了一个精确的计算公式。

On the Mean Value of High-Powers of a Special Character Sum Modulo a Prime

In this paper,we use the elementary methods,the properties of Dirichlet character sums and the classical Gauss sums to study the estimation of the mean value of high-powers for a special character sum modulo a prime,and derive an exact computational formula.It can be conveniently programmed by the“Mathematica”software,by which we can get the exact results easily.

关于k次Gauss和与Kloosterman和的混合均值

利用解析方法以及经典Gauss和的性质研究了一类k次Gauss和与Kloosterman和的混合均值的计算问题,并得到了一个有趣的渐近公式。

二次互倒律与二次Gauss和的计算

二次互倒律是初等数论中最著名的一个定理 ,它是由法国数学家Legendre等人发现的 ,德国数学家Gauss把这个结果称为是数论的酵母 ,并且首先给出了它的完全的证明。其后世界上多位数学家对互倒律作了重要的推广。而在互倒律的发展和证明过程中 ,Gauss和曾经起过重要的作用。另一方面 ,二次Gauss和又是一种特殊的特征和 ,而特征和是数论中的一个重要工具 ,它在数论的一系列重要问题的研究中有着广泛的应用。利用线性代数的知识 ,作出一个迹为二次Gauss和的n阶矩阵 ,根据线性代数中矩阵的迹等于其所有特征值之和这一基本性质 ,通过求出矩阵所有的特征值来求得二次Gauss和的值 ,从而给出了一种新的计算二次Gauss和的方法。

一类新的广义Gauss和及其四次均值

该文给出了一类新的广义Gauss和G(a,b,c,χ;q)。为寻找这些和式之间存在的潜在关系,从其定义出发,通过应用初等解析方法以及与三角和相关的一些重要性质对这类新的广义Gauss和G(a,b,c,χ;q)的四次均值进行了研究。最终通过计算给出了它的一个重要的恒等式。此结果扩充了解析数论中的经典Gauss和与Kloosterman和的内容,也为该领域的进一步发展做出了新的贡献。同时,也提出了此类领域中仍然存在且未被解决的一些和式的均值计算问题。

基于二次高斯和的增信码重量分布

循环码是一类具有高效编码和译码算法的重要线性码,在通信和数据存储系统等领域被广泛应用。重量分布是循环码的重要研究对象,如何构造具有较少重量的循环码是编码理论中的重要研究问题。借助于二次高斯和、有限域上特征标的性质等数论工具研究了一类循环码的增信码,给出了增信码的重量分布和参数。结果表明,这类增信码是射影循环码且具有较少的重量。该增信码与原码相比有更高的传输效率且其对偶码关于球填充界最优或几乎最优。此外,还给出了原码的完全重量分布。