期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
On Ramanujan Sums over a Dedekind Domain with Finite Norm Property
1
作者 Zhi Yong ZHENG Man CHEN Zi Wei HONG 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2023年第1期149-160,共12页
In this paper,we consider Ramanujan’s sums over arbitrary Dedekind domain with finite norm property.We define the Ramanujan’s sumsη(a,A)andη(B,A),where a is an arbitrary element in a Dedekind domain,B is an ideal ... In this paper,we consider Ramanujan’s sums over arbitrary Dedekind domain with finite norm property.We define the Ramanujan’s sumsη(a,A)andη(B,A),where a is an arbitrary element in a Dedekind domain,B is an ideal and A is a non-zero ideal.In particular,we discuss the Kluyver formula and Hèolder formula forη(a,A)andη(B,A).We also prove the reciprocity formula enjoyed byη(B,A)and the orthogonality relations forη(a,A)in the last two parts. 展开更多
关键词 Dedekind domains ramanujan sums primitive additive character reciprocity formula orthogonality property
原文传递
Prime-Composition Approach to Ramanujan-Fourier Transform Computation
2
作者 周丽娜 王祖林 赵磊 《Transactions of Tianjin University》 EI CAS 2014年第3期197-202,共6页
Ramanujan sums (RS) and their Fourier transforms have attracted more and more attention in signal processing in recent years. Due to their non-periodic and non-uniform spectrum, RS are widely used in low-frequency n... Ramanujan sums (RS) and their Fourier transforms have attracted more and more attention in signal processing in recent years. Due to their non-periodic and non-uniform spectrum, RS are widely used in low-frequency noise processing, Doppler spectrum estimation and time-frequency analysis. However, the traditional method for calculating RS values is rather complex since it requires two numbers' factorization in two arithmetic functions. For a length-n vector, its Ramanujan-Fourier transform usually involves a series of RS values which will occupy O(n2) memory units. Thus, in this paper an approach based on prime-composition is proposed to reduce the complexity of RS calculation to O(n). Meanwhile, the complexity of Ramanujan-Fourier transform can be further reduced from O(n2) to O(n In(In(n))) . 展开更多
关键词 ramanujan sums ramanujan-Fourier transform prime-composition
下载PDF
Some Identities Involving Certain Hardy Sums and Ramanujan Sum 被引量:1
3
作者 HongYanLIU WenPengZHANG 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2005年第1期109-116,共8页
The main purpose of this paper is, using the mean-value theorem of Dirichletl-functions, to study the distribution properties of the hybrid mean value involving certain Hardysums and Ramanujan sum, and give four inter... The main purpose of this paper is, using the mean-value theorem of Dirichletl-functions, to study the distribution properties of the hybrid mean value involving certain Hardysums and Ramanujan sum, and give four interesting identities. 展开更多
关键词 Certain Hardy sums ramanujan sum Hybrid mean value IDENTITIES
原文传递
Notes on the Borwein-Choi Conjecture of Littlewood Cyclotomic Polynomials
4
作者 Shao Fang HONG Wei CAOMathematical College, Sichuan University, Chengdu 610064, P. R. China 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2009年第1期65-76,共12页
Borwein and Choi conjectured that a polynomial P(x) with coefficients ±1 of degree N - 1 is cyclotomic iffP(x)=±Φp1(±x)ΦP2(±x^p1)…Φpr(±x^p1p2…pr-1),where N = P1P2 … pτ and the... Borwein and Choi conjectured that a polynomial P(x) with coefficients ±1 of degree N - 1 is cyclotomic iffP(x)=±Φp1(±x)ΦP2(±x^p1)…Φpr(±x^p1p2…pr-1),where N = P1P2 … pτ and the pi are primes, not necessarily distinct. Here Φ(x) := (x^p - 1)/(x - 1) is the p-th cyclotomic polynomial. They also proved the conjecture for N odd or a power of 2. In this paper we introduce a so-called E-transformation, by which we prove the conjecture for a wider variety of cases and present the key as well as a new approach to investigate the coniecture. 展开更多
关键词 cyclotomic polynomial Littlewood polynomial E-transformation ramanujan sum least element
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部