Related papers: Character sums with Beatty sequences on Burgess-ty…

We develop the concept of character level for the complex irreducible characters of finite, general or special, linear and unitary groups. We give characterizations of the level of a character in terms of its Lusztig's label and in terms of…

We study smoothed character sums involving $\sum_{m,n} ( \frac{m}{n} )_2$, where $( \frac{m}{n} )_2$ denotes the quadratic symbol in the Gaussian field. We extend previously known results to obtain asymptotic formulas for the sums…

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…

A sequence of non-negative integers is called a B_k sequence if all the sums of arbitrary k elements are different. In this paper, we will present a new estimation for the upper bound of B_k sequences.

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

A character of a finite group having degree $n$ takes values which may be expressed as sums of $n$ or fewer roots of unity. In this note, we prove a result which describes the irreducible constituents of generalized characters on abelian…

The Burgess inequality is the best upper bound we have for the character sum $S_{\chi}(M,N) = \sum_{M<n\le M+N} \chi(n).$ Until recently, no explicit estimates had been given for the inequality. In 2006, Booker gave an explicit estimate for…

In this paper, we investigate the size of moments of quadratic character sums averaged over the family of fundamental discriminants. We obtain an asymptotic formula for all integer moments in a restricted range of parameters using a…

In this paper we consider a variety of mixed character sums. In particular we extend a bound of Heath-Brown and Pierce to the case of squarefree modulus, improve on a result of Chang for mixed sums in finite fields, we show in certain…

We evaluate the character sum sigma_m sigma_n (m/n) where the two sums are of approximately the same length. The answer is surprising.

We establish new bounds on character values and character ratios for finite groups $G$ of Lie type, which are considerably stronger than previously known bounds, and which are best possible in many cases. These bounds have the form…

We consider a family of character sums as multiplicative analogues of Kloosterman sums. Using Gauss sums, Jacobi sums and Deligne's bound for hyper-Kloosterman sums, we establish asymptotic formulae for any real (positive) moments of the…

Let $ p_{i, n}, i=1,..., N(n)=2^{n-1} $ be the lengths of intervals between the neighboring fractions of Brocot sequence $ F_n $. We obtain an asymptotic formula for $\sigma_{\beta}(F_n)=\sum_{i=1}^{N(n)} p_{i, n}^{\beta} $,which improves…

Very recently, in [Das et al., J. Lond. Math. Soc., 2025], statistically characterized subgroups were studied for certain classes of non-arithmetic sequences. Subsequently, in [Das et al., Bull. Sci. Math., 2025], characterized subgroups…

Let $q\geqslant2$ be an integer, $\chi$ be any non-principal character mod $q$, and $H=H(q)\leqslant q.$ In this paper the authors prove some estimates for character sums of the form…

In this paper, we use Abel's summation formula to evaluate several quadratic and cubic sums of the form: \[{F_N}\left( {A,B;x} \right) := \sum\limits_{n = 1}^N {\left( {A - {A_n}} \right)\left( {B - {B_n}} \right){x^n}} ,\;x \in [ - 1,1]\]…

A method for estimating the merit factors of sequences will be provided. The result is also effective in determining the nonexistence of certain infinite collections of cyclic difference sets and cyclic matrices and associated binary…

We consider sums of the form $$F_\chi(\alpha,\beta;\theta) := \sum_{\alpha p<n\le\beta p}\chi(n)e(n\theta),$$ where $\chi$ is a non-principal Dirichlet character modulo a prime number $p$. We prove that $$ \sqrt p \log \log p \ll \max_{0…

Let $\alpha>1$ be an irrational number. We establish asymptotic formulas for the number of partitions of $n$ into summands and distinct summands, chosen from the Beatty sequence $(\lfloor\alpha m\rfloor)_{m\in\mathbb{N}}$. This improves…

Let $\chi=\chi_q$ be a primitive character mod $q$ and fix $\Delta>0$. In 1989 Graham and Ringrose gave strong bounds on character sums $\sum_{M<n\leq M+N} \chi(n)$ in intervals of length $N=q^\Delta$ whenever $q$ is squarefree and is…