English
Related papers

Related papers: Estimates for Character Sums with Various Convolut…

200 papers

We study the character sums \[\phi_{(m,n)}(a,b)=\sum_{x\in\mathbb{F}_q}\phi\left(x(x^{m}+a)(x^{n}+b)\right),\textrm{ and, } \psi_{(m,n)}(a,b)=\sum_{x\in\mathbb{F}_q}\phi\left((x^{m}+a)(x^{n}+b)\right)\] where $\phi$ is the quadratic…

Number Theory · Mathematics 2017-01-05 Mohammad Sadek

We prove an explicit version of Burgess' bound on character sums for composite moduli.

Number Theory · Mathematics 2021-04-06 Niraek Jain-Sharma , Tanmay Khale , Mengzhen Liu

We present algorithms to evaluate two types of multiple sums, which appear in higher-order loop computations. We consider expansions of a generalized hypergeometric-type sums, $\sum_{n_1,...,n_N} [Gamma(a1.n+c1) Gamma(a2.n}+c2) ...…

High Energy Physics - Theory · Physics 2015-06-12 C. Anzai , Y. Sumino

We consider the size of large character sums, proving new lower bounds for the quantity $\Delta(N,q) = \sup_{\chi\neq \chi_0 mod q} |\sum_{n < N} \chi(n)|$ for almost all ranges of $N$. The results are proven using the resonance method and…

Number Theory · Mathematics 2014-01-14 Bob Hough

Two conjectures, posed by Finch-Smith, Harrington, and Wong in a paper published in Integers in $2023$, are proven. Given a monic biquadratic polynomial $f(x) = x^4 + cx^2 + e$, we prove a formula for the sum of its distinct outputs modulo…

Number Theory · Mathematics 2023-09-26 Samer Seraj

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

The Postnikov character formula is used to express large portions of a Dirichlet character sum in terms of quadratic exponential sums. The quadratic sums are then computed using an analytic algorithm previously derived by the author. This…

Number Theory · Mathematics 2014-09-05 Ghaith A. Hiary

Characteristic quasi-polynomials enumerate the number of points in the complement of hyperplane arrangements modulo positive integers. In this paper, we compute the characteristic quasi-polynomials of the restrictions of the Shi…

Combinatorics · Mathematics 2026-02-09 Akihiro Higashitani , Masato Konoike , Norihiro Nakashima , Satoshi Ono

We consider sums of the form \[\sum_{j=0}^{n-1}F_1(a_1n+b_1j+c_1)F_2(a_2n+b_2j+c_2)... F_k(a_kn+b_kj+c_k),\] in which each $\{F_i(n)\}$ is a sequence that satisfies a linear recurrence of degree $D(i)<\infty$, with constant coefficients. We…

Combinatorics · Mathematics 2007-05-23 Curtis Greene , Herbert S. Wilf

Let $\chi$ be a non-real Dirichlet character modulo a prime $q$. In this paper we prove that the distribution of the short character sum $S_{\chi,H}(x)=\sum_{x< n\leq x+H} \chi(n)$, as $x$ runs over the positive integers below $q$,…

Number Theory · Mathematics 2011-07-01 Youness Lamzouri

In this paper, We use the Fourier series expansion of real variables function, We give a formula to calculate the Dirichlet character sum, and four special examples are given.

General Mathematics · Mathematics 2022-11-17 JinHua Fei

Let $\chi$ be an irreducible character of a group $G.$ We denote the sum of the codegrees of the irreducible characters of $G$ by $S_c(G)=\sum_{\chi\in {\rm Irr}(G)}{\rm cod}(\chi).$ We consider the question if $S_c(G)\leq S_c(C_n)$ is true…

Group Theory · Mathematics 2024-02-21 Mark L. Lewis , Quanfu Yan

The discrete acyclic convolution computes the 2n-1 sums sum_{i+j=k; (i,j) in [0,1,2,...,n-1]^2} (a_i b_j) in O(n log n) time. By using suitable offsets and setting some of the variables to zero, this method provides a tool to calculate all…

Data Structures and Algorithms · Computer Science 2019-10-28 Mitsuru Funakoshi , Julian Pape-Lange

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

We obtain a new bound on certain double sums of multiplicative characters improving the range of several previous results. This improvement comes from new bounds on the number of collinear triples in finite fields, which is a classical…

Number Theory · Mathematics 2018-03-26 Ilya D. Shkredov , Igor E. Shparlinski

We present a new sum rule for Clebsch-Gordan coefficients using generalized characters of irreducible representations of the rotation group. The identity is obtained from an integral involving Gegenbauer ultraspherical polynomials. A…

Mathematical Physics · Physics 2019-04-30 Jean-Christophe Pain

Let $\chi$ be a primitive character modulo $q$, and let $\delta > 0$. Assuming that $\chi$ has large order $d$, for any $d$th root of unity $\alpha$ we obtain non-trivial upper bounds for the number of $n \leq x$ such that $\chi(n) =…

Number Theory · Mathematics 2024-05-02 Alexander P. Mangerel , Yichen You

We show that for any mod $p^m$ characters, $\chi_1, \dots, \chi_k,$ the Jacobi sum, $$ \sum_{x_1=1}^{p^m}\dots \sum_{\substack{x_k=1\\x_1+\dots+x_k=B}}^{p^m}\chi_1(x_1)\dots \chi_k(x_k), $$ has a simple evaluation when $m$ is sufficiently…

Number Theory · Mathematics 2014-10-24 Misty Long , Vincent Pigno , Christopher Pinner

We evaluate the average of cubic and quartic Dirichlet character sums with the modulus going up to a size comparable to the length of the individual sums. This generalizes a result of Conrey, Farmer and Soundararajan on quadratic Dirichlet…

Number Theory · Mathematics 2020-12-11 Peng Gao , Liangyi Zhao

We evaluate the convolution sums $\sum_{l,m\in {\mathbb N}, {l+15m=n}} \sigma(l) \sigma(m)$ and $\sum_{l,m\in {\mathbb N}, {3l+5m=n}} \sigma(l) \sigma(m)$ for all $n\in {\mathbb N}$ using the theory of quasimodular forms and use these…

Number Theory · Mathematics 2012-10-23 B. Ramakrishnan , Brundaban Sahu
‹ Prev 1 3 4 5 6 7 10 Next ›