Related papers: On Some Multiple Character Sums
We consider questions related to the structure of infinite words (over an integer alphabet) with bounded additive complexity, i.e., words with the property that the number of distinct sums exhibited by factors of the same length is bounded…
Let A and B be finite sets in a commutative group. We bound |A+hB| in terms of |A|, |A+B| and h. We provide a submultiplicative upper bound that improves on the existing bound of Imre Ruzsa by inserting a factor that decreases with h.
In this paper we consider the problem of estimating character sums to composite modulus and obtain some progress towards removing the cubefree restriction in the Burgess bound. Our approach is to estimate high order moments of character…
It is known that extreme characters of several inductive limits of compact groups exhibit multiplicativity in a certain sense. In the paper, we formulate such multiplicativity for inductive limit quantum groups and provide explicit examples…
We study sums of Dirichlet characters over polynomials in $\mathbb{F}_q[t]$ with a prescribed number of irreducible factors. Our main results are explicit formulae for these sums in terms of zeros of Dirichlet L-functions. We also exhibit…
We obtain explicit bounds on the moments of character sums, refining estimates of Montgomery and Vaughan. As an application we obtain results on the distribution of the maximal magnitude of character sums normalized by the square root of…
Two infinite sequences A and B of non-negative integers are called additive complements, if their sum contains all sufficiently large integers. Let $A(x)$ and $B(x)$ be the counting functions of A and B. In this paper, we extend the results…
We establish a normal approximation for the limiting distribution of partial sums of random Rademacher multiplicative functions over function fields, provided the number of irreducible factors of the polynomials is small enough. This…
We show that for any mod $2^m$ characters, $\chi_1, \chi_2,$ the complete exponential sum, $$ \sum_{x=1}^{2^m}\chi_1(x) \chi_2(Ax^k+B), $$ has a simple explicit evaluation.
A combinatorial formula to generate U(N) character expansions is presented. It is shown that the resulting character expansion formulas greatly simplify a number of problems where integrals over the group manifolds need to be calculated.…
We prove a character sum identity for Coxeter arrangements which is a finite field analogue of Macdonald's conjecture proved by Opdam.
Let $\{a_{1}, a_{2},\ldots, a_{n},\ldots\}$ be a sequence of complex numbers which has at most polynomial growth and satisfies an extra assumption. In this paper, inspired by a recent work of Sasane, we give an explanation of the sum…
We improve a recent result by Shparlinski and Banks related to sums with convolution of Dirichlet characters.
Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$ which satisfy certain extra conditions. For this average sum we obtain an explicit upper bound, which is close to the optimal. As an application we improve…
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…
For finite subsets A_1,...,A_n of a field, their sumset is given by {a_1+...+a_n: a_1 in A_1,...,a_n in A_n}. In this paper we study various restricted sumsets of A_1,...,A_n with restrictions of the following forms: a_i-a_j not in S_{ij},…
We obtain a new bound in the uniform version of the Glasner property for matrices with polynomial entries, improving that of K. Bulinski and A. Fish (2021). This improvement is based on a more careful examination of complete rational…
We state and prove a general summation identity. The identity is then applied to derive various summation formulas involving the generalized harmonic numbers and related quantities. Interesting results, mostly new, are obtained for both…
In this note, we extend the definition of multiple harmonic sums and apply their stuffle relations to obtain explicit evaluations of the sums $R_n(p,t)=\sum\nolimits_{m=0}^n m^p H_m^t$, where $H_m$ are harmonic numbers. When $t\le 4$ these…
In this paper, we study numbers $n$ that can be factored in four different ways as $n = A B = (A + a_1) (B - b_1) = (A + a_2) (B - b_2) = (A + a_3) (B - b_3)$ with $B \le A$, $1 \le a_1 < a_2 < a_3 \le C$ and $1 \le b_1 < b_2 < b_3 \le C$.…