On the polynomial Ramanujan sums over finite fields

被引:0
作者
Zhiyong Zheng
机构
[1] Beihang University,School of Mathematics and Systems Science
来源
The Ramanujan Journal | 2018年 / 46卷
关键词
Polynomial Ramanujan sums; Finite fields; Reciprocity formula; Orthogonality relation; Davenport–Hasse’s type formula; Primary 11T55; 11T24; Secondary 11L05;
D O I
暂无
中图分类号
学科分类号
摘要
The polynomial Ramanujan sum was first introduced by Carlitz (Duke Math J 14:1105–1120, 1947), and a generalized version by Cohen (Duke Math J 16:85–90, 1949). In this paper, we study the arithmetical and analytic properties of these sums, deriving various fundamental identities, such as Hölder formula, reciprocity formula, orthogonality relation, and Davenport–Hasse type formula. In particular, we show that the special Dirichlet series involving the polynomial Ramanujan sums are, indeed, the entire functions on the whole complex plane, and we also give a square mean values estimation. The main results of this paper are new appearance to us, which indicate the particularity of the polynomial Ramanujan sums.
引用
收藏
页码:863 / 898
页数:35
相关论文
共 50 条
  • [21] On Solving Systems of Diagonal Polynomial Equations Over Finite Fields
    Ivanyos, Gabor
    Santha, Miklos
    FRONTIERS IN ALGORITHMICS (FAW 2015), 2015, 9130 : 125 - 137
  • [22] Preperiodic points of polynomial dynamical systems over finite fields
    Andersen, Aaron
    Garton, Derek
    INTERNATIONAL JOURNAL OF NUMBER THEORY, 2024, 20 (09) : 2307 - 2316
  • [23] Dedekind sums for finite fields
    Harnahata, Yoshinori
    DIOPHANTINE ANALYSIS AND RELATED FIELDS - DARF 2007/2008, 2008, 976 : 96 - 102
  • [24] An asymptotic formula for counting subset sums over subgroups of finite fields
    Zhu, Guizhen
    Wan, Daqing
    FINITE FIELDS AND THEIR APPLICATIONS, 2012, 18 (01) : 192 - 209
  • [25] UNLIKELY INTERSECTIONS OVER FINITE FIELDS: POLYNOMIAL ORBITS IN SMALL SUBGROUPS
    Merai, Laszlo
    Shparlinski, Igor E.
    DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS, 2020, 40 (02) : 1065 - 1073
  • [26] Polynomial evaluation over finite fields: new algorithms and complexity bounds
    Michele Elia
    Joachim Rosenthal
    Davide Schipani
    Applicable Algebra in Engineering, Communication and Computing, 2012, 23 : 129 - 141
  • [27] Polynomial evaluation over finite fields: new algorithms and complexity bounds
    Elia, Michele
    Rosenthal, Joachim
    Schipani, Davide
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2012, 23 (3-4) : 129 - 141
  • [28] TOWARD AN OPTIMAL QUANTUM ALGORITHM FOR POLYNOMIAL FACTORIZATION OVER FINITE FIELDS
    Doliskani, Javad
    QUANTUM INFORMATION & COMPUTATION, 2019, 19 (1-2) : 1 - 13
  • [29] Computing zeta functions of large polynomial systems over finite fields
    Cheng, Qi
    Rojas, J. Maurice
    Wan, Daqing
    JOURNAL OF COMPLEXITY, 2022, 73
  • [30] A note on character sums in finite fields
    Bhowmick, Abhishek
    Le, Thai Hoang
    Liu, Yu-Ru
    FINITE FIELDS AND THEIR APPLICATIONS, 2017, 46 : 247 - 254