English
Related papers

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

200 papers

A few elementary estimates of a basic character sum over the prime numbers are derived here. These estimates are nontrivial for character sums modulo large q. In addition, an omega result for character sums over the primes is also included.

General Mathematics · Mathematics 2012-05-25 N. A. Carella

In this paper, we study the principal specialization of monomial symmetric polynomials and investigate the special values of these polynomials at \[ \zeta_{(n,k)} := ( 1, \zeta_n, \zeta_n^2, \dots, \zeta_n^{kn-1} ), \] where $\zeta_n$ is a…

Representation Theory · Mathematics 2026-05-28 Naoya Yamaguchi , Yuka Yamaguchi , Genki Shibukawa

In this paper, we study the distribution of the sequence of integers $2^{\omega(n)}$ under the assumption of the strong Riemann hypothesis, where $\omega(n)$ denotes the number of distinct prime divisors of $n$. We provide an asymptotic…

Number Theory · Mathematics 2025-02-06 K. Venkatasubbareddy , A. Sankaranarayanan

Let $p$ be an odd prime, and define $$G_p(x)=\prod_{k=1}^{(p-1)/2}\left(x-e^{2\pi i k^2/p}\right).$$ In this paper we study values of $G_p(x)$ at roots of unity via Galois theory, and confirm some previous conjectures. For example, for any…

Number Theory · Mathematics 2026-05-12 Zhi-Wei Sun

In this article we establish the asymptotic behavior of generating functions related to the exponential sum over finite fields of elementary symmetric functions and their perturbations. This asymptotic behavior allows us to calculate the…

Number Theory · Mathematics 2019-09-02 Luis A. Medina , L. Brehsner Sepúlveda , César A. Serna-Rapello

Let $f(x)=x^n+a_{n-1}x^{n-1}+\dots+a_0$ be an irreducible polynomial with integer coefficients. For a prime $p$ for which $f(x)$ is fully splitting modulo $ p$, we consider $n$ roots $r_i$ of $f(x)\equiv 0\bmod p$ with $0 \le r_1\le\dots\le…

Number Theory · Mathematics 2017-06-28 Yoshiyuki Kitaoka

Let $\mathbb{F}_{q}$ be a finite field, $\mathbb{F}_{q^s}$ be an extension of $\mathbb{F}_q$, let $f(x)\in \mathbb{F}_q[x]$ be a polynomial of degree $n$ with $\gcd(n,q)=1$. We present a recursive formula for evaluating the exponential sum…

Information Theory · Computer Science 2010-01-29 Xiwang Cao , Lei Hu

Let $\mathbb{F}_{q}$ be a finite field, $\mathbb{F}_{q^s}$ be an extension of $\mathbb{F}_q$, let $f(x)\in \mathbb{F}_q[x]$ be a polynomial of degree $n$ with $\gcd(n,q)=1$. We present a recursive formula for evaluating the exponential sum…

Information Theory · Computer Science 2010-01-26 Xiwang Cao , Lei Hu

Let $P^{\left(\frac 12\right)}(n)$ denote the middle prime factor of $n$ (taking into account multiplicity). More generally, one can consider, for any $\alpha \in (0,1)$, the $\alpha$-positioned prime factor of $n$, $P^{(\alpha)}(n)$. It…

Number Theory · Mathematics 2023-05-03 Nathan McNew , Paul Pollack , Akash Singha Roy

Let $p$ be a prime, and let $f(x)$ be an integer-valued polynomial. By a combinatorial approach, we obtain a nontrivial lower bound of the $p$-adic order of the sum $$\sum_{k=r(mod p^{\beta})}\binom{n}{k}(-1)^k f([(k-r)/p^{\alpha}]),$$…

Number Theory · Mathematics 2015-06-26 Zhi-Wei Sun

Fix irrational numbers $\alpha,\hat\alpha>1$ of finite type and real numbers $\beta,\hat\beta\ge 0$, and let $B$ and $\hat B$ be the Beatty sequences $$ B:=(\lfloor\alpha m+\beta\rfloor)_{m\ge 1}\quad\text{and}\quad\hat…

Number Theory · Mathematics 2016-12-06 William D. Banks , Victor Z. Guo

We obtain new bounds of multivariate exponential sums with monomials, when the variables run over rather short intervals. Furthermore, we use the same method to derive estimates on similar sums with multiplicative characters to which…

Number Theory · Mathematics 2019-02-20 Igor Shparlinski

Let $p$ be a prime number, $X$ be an absolutely irreducible affine plane curve over $\mathbb{F}_p$, and $g,f\in\mathbb{F}_p(x,y)$. We study the distribution of the values of the hybrid exponential sums S_n on $n\in\mathcal{I}$ for some…

Number Theory · Mathematics 2013-09-09 Kit-Ho Mak , Alexandru Zaharescu

We propose a new conjecture on some exponential sums. These particular sums have not apparently been considered in the literature. Subject to the conjecture we obtain the first effective construction of asymptotically good tree codes. The…

Computational Complexity · Computer Science 2013-12-11 Cristopher Moore , Leonard J. Schulman

In this paper, we investigate the distribution of the maximum of character sums over the family of primitive quadratic characters attached to fundamental discriminants $|d|\leq x$. In particular, our work improves results of Montgomery and…

Number Theory · Mathematics 2024-10-23 Youness Lamzouri

In [3], we have introduced a probability measure to study the power and exponential sums for a certain coding system. The distribution function of the probability measure gives explicit formulas for the power and exponential sums.…

Number Theory · Mathematics 2015-05-19 Yuichi Kamiya , Tatsuya Okada , Takeshi Sekiguchi , Yasunobu Shiota

Let $k$ be a finite field of characteristic $p$, $l$ a prime number distinct to $p$, $\psi:k\to \bar {\bf Q}_l^\ast$ a nontrivial additive character, and $\chi:{k^\ast}^n\to \bar{\bf Q}_l^\ast$ a character on ${k^\ast}^n$. Then $\psi$…

Number Theory · Mathematics 2007-05-23 Lei Fu

We study some divisibility properties of multiperfect numbers. Our main result is: if $N=p_1^{\alpha_1}... p_s^{\alpha_s} q_1^{2\beta_1}... q_t^{2\beta_t}$ with $\beta_1, ..., \beta_t$ in some finite set S satisfies…

Number Theory · Mathematics 2007-07-31 Tomohiro Yamada

For a prime $p$ and an integer $u$ with $\gcd(u,p)=1$, we define Fermat quotients by the conditions $$ q_p(u) \equiv \frac{u^{p-1} -1}{p} \pmod p, \qquad 0 \le q_p(u) \le p-1. $$ D. R. Heath-Brown has given a bound of exponential sums with…

Number Theory · Mathematics 2014-02-26 Igor E. Shparlinski

We consider incomplete exponential sums in several variables of the form S(f,n,m) = \frac{1}{2^n} \sum_{x_1 \in \{-1,1\}} ... \sum_{x_n \in \{-1,1\}} x_1 ... x_n e^{2\pi i f(x)/p}, where m>1 is odd and f is a polynomial of degree d with…

Number Theory · Mathematics 2010-11-16 Eduardo Duenez , Steven J. Miller , Howard Straubing , Amitabha Roy
‹ Prev 1 4 5 6 7 8 10 Next ›