English
Related papers

Related papers: Exponential Sums, Cyclic Codes and Sequences: the …

200 papers

We study odd numbers through a straightforward indexing. We focus in particular on odd prime and composite numbers and their distribution. With a counting argument, we calculate the limit of two sums and compare their convergence rate.

General Mathematics · Mathematics 2018-12-11 Wolf Marc , Wolf François , Villemin François-Xavier

Sums over inverse s-th powers of semiprimes and k-almost primes are transformed into sums over products of powers of ordinary prime zeta functions. Multinomial coefficients known from the cycle decomposition of permutation groups play the…

Number Theory · Mathematics 2009-09-30 Richard J. Mathar

We give nontrivial bounds for the bilinear sums $$ \sum_{u = 1}^{U} \sum_{v=1}^V \alpha_u \beta_v \mathbf{\,e}_p(u/f(v)) $$ where $\mathbf{\,e}_p(z)$ is a nontrivial additive character of the prime finite field ${\mathbb F}_p$ of $p$…

Number Theory · Mathematics 2016-05-25 Igor E. Shparlinski

Let f(z) = sum_n a(n) n^{(k-1)/2} e(nz) be a cusp form for Gamma_0(N), character chi and weight k geq 4. Let q(x) = x^2 + sx + t be a polynomial with integral coefficients. It is shown that sum_{n \leq X} a(q(n)) = cX + O(X^{6/7+eps}) for…

Number Theory · Mathematics 2008-04-01 Valentin Blomer

We obtain a new estimate for Kloosterman sum with primes $p\leqslant X$ to composite modulo $q$, that is, for the exponential sum of the type \[ \sum\limits_{p\leqslant X,\;p\,\nmid q}\exp{\biggl(\frac{2\pi…

Number Theory · Mathematics 2019-11-25 M. A. Korolev

In this paper, a family of six-weight cyclic codes over GF(p) whose duals have two zeros is presented, where p is an odd prime. And the weight distribution of these cyclic codes is determined.

Number Theory · Mathematics 2013-12-18 Yan Liu , Haode Yan , Chunlei Liu

In this article, we study extreme values of quadratic character sums with multiplicative coefficients $\sum_{n \le N}f(n)\chi_d(n)$. For a positive number $N$ within a suitable range, we employ the resonance method to establish a…

Number Theory · Mathematics 2025-08-26 Zikang Dong , Zhonghua Li , Yutong Song , Shengbo Zhao

We consider cyclic codes $\mathcal{C}_\mathcal{L}$ associated to quadratic trace forms in $m$ variables $Q_R(x) = \operatorname{Tr}_{q^m/q}(xR(x))$ determined by a family $\mathcal{L}$ of $q$-linearized polynomials $R$ over…

Combinatorics · Mathematics 2020-03-20 Ricardo A. Podestá , Denis E. Videla

We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…

Number Theory · Mathematics 2020-07-30 Igor E. Shparlinski , Qiang Wang

Let $q$ be an odd prime power and let $X(m,q)$ be the set of symmetric bilinear forms on an $m$-dimensional vector space over $\mathbb{F}_q$. The partition of $X(m,q)$ induced by the action of the general linear group gives rise to a…

Combinatorics · Mathematics 2014-10-28 Kai-Uwe Schmidt

Let p be a prime = 3 (mod 4). A number of elegant number-theoretical properties of the sums T(p) = \sqrt{p}sum_{n=1}^{(p-1)/2} tan(n^2\pi/p) and C(p) = \sqrt{p}sum_{n=1}^{(p-1)/2} cot(n^2\pi/p) are proved. For example, T(p) equals p times…

Number Theory · Mathematics 2012-05-21 A. Laradji , M. Mignotte , N. Tzanakis

In this manuscript we provide a new polynomial pattern. This pattern allows to find a polynomial expansion of the form \[x^{2m+1} = \sum_{k=1}^{x}\sum_{r=0}^{m} \mathbf{A}_{m,r} k^r (x-k)^r,\] where $x,m\in\mathbb{N}$ and $\mathbf{A}_{m,r}$…

General Mathematics · Mathematics 2022-11-01 Petro Kolosov

Let f be a polinomial with coefficients in a finite field F. Let $\Psi : F \to C^{\ast}$ be a non-trivial additive character. In this paper we give bounds for the exponential sums $\sum_{x\in F^n} \Psi (Tr_{F/F_p} (f(x)))$ in some cases…

alg-geom · Mathematics 2008-02-03 Ricardo Garcia Lopez

We study pairs of consecutive odd numbers through a straightforward indexing. We focus in particular on twin primes and their distribution. With a counting argument, we calculate the limit of an alternating sum that is equal to 1 which…

General Mathematics · Mathematics 2021-06-08 Marc Wolf , FranÇOis Wolf , FranÇOis-Xavier Villemin

This note investigates the prime values of the polynomial $f(t)=qt^2+a$ for any fixed pair of relatively prime integers $ a\geq 1$ and $ q\geq 1$ of opposite parity. For a large number $x\geq1$, an asymptotic result of the form $\sum_{n\leq…

General Mathematics · Mathematics 2021-04-15 N. A. Carella

We discuss an elementary method for the evaluation of the convolution sums $\underset{\substack{ {(l,m)\in\mathbb{N}_{0}^{2}} \\ {\alpha\,l+\beta\,m=n} } }{\sum}\sigma(l)\sigma(m)$ for those $\alpha,\beta\in\mathbb{N}$ for which…

Number Theory · Mathematics 2017-08-01 Ebénézer Ntienjem

Let $\mathbf{F}_q$ be a finite field of $q$ elements. We show that the normalized Jacobi sum $q^{-(m-1)/2}J(\chi_1,\dots,\chi_m)$ ($\chi_1\dotsm \chi_m$ nontrivial) is asymptotically equidistributed on the unit circle, when $\chi_1\in…

Number Theory · Mathematics 2021-09-21 Qing Lu , Weizhe Zheng

The permutation groups of cyclic codes are widely applicable in determining the weight distribution of codes, decoding theory and various other areas. In this paper, by employing two distinct matrix representations, we can relate cyclic…

Information Theory · Computer Science 2026-05-26 Junjie Huang , Jicheng Ma , Chang-An Zhao

In this paper, for an even integer $n\geq 4$ and any positive integer $k$ with ${\rm gcd}(n/2,k)={\rm gcd}(n/2-k,2k)=d$ being odd, a class of $p$-ary codes $\mathcal{C}^k$ is defined and their weight distribution is completely determined,…

Information Theory · Computer Science 2008-02-26 Xiangyong Zeng , Nian Li , Lei Hu

Recently, there has been intensive research on the weight distributions of cyclic codes. In this paper, we compute the weight distributions of three classes of cyclic codes with Niho exponents. More specifically, we obtain two classes of…

Information Theory · Computer Science 2014-01-10 Shuxing Li , Tao Feng , Gennian Ge