Related papers: Long large character sums

We obtain nontrivial estimates of quadratic character sums of division polynomials $\Psi_n(P)$, $n=1,2, ...$, evaluated at a given point $P$ on an elliptic curve over a finite field of $q$ elements. Our bounds are nontrivial if the order of…

We obtain a tight, up to a logarithmic factor, upper bound on the number of solutions to the equation $$ \sum_{j=1}^n a_j \frac{s_j}{r_j} =a_0, \qquad $$ with variables $r_1,...,r_n$ in an arbitrary box at the origin and variables $s_1,...,…

Let $Q(x,y,z)$ be an integral quadratic form with determinant coprime to some modulus $q$. We show that $q\mid Q$ for some non-zero integer vector $(x,y,z)$ of length $O(q^{5/8+\varepsilon})$, for any fixed $\varepsilon>0$. Without the…

In this article, we investigate high moments of zeta sums $\sum_{n\le x}n^{i t}$. We show unconditional lower bounds for them.

It has been proven that, when normalized by $n$, the expected length of a longest common subsequence of $d$ random strings of length $n$ over an alphabet of size $\sigma$ converges to some constant that depends only on $d$ and $\sigma$.…

We develop an approach to study character sums, weighted by a multiplicative function $f:\mathbb{F}_q[t]\to S^1$, of the form \begin{equation} \sum_{G\in \mathcal{M}_N}f(G)\chi(G)\xi(G), \end{equation} where $\chi$ is a Dirichlet character…

We estimate weighted character sums with determinants $ad-bc $ of $2\times 2$ matrices modulo a prime $p$ with entries $a,b,c,d $ varying over the interval $ [1,N]$. Our goal is to obtain nontrivial bounds for values of $N$ as small as…

For a given Dirichlet character $\chi (n) = e^{i \theta_n}$, we prove central limit theorems for the series $\sum_{p'} \cos \theta_{p'}$ for non-principal characters, and $\sum_{p' } \cos (t \log p')$ for principal characters, where $p'$…

Recently, Granville and Soundararajan have made fundamental breakthroughs in the study of character sums. Building on their work and using estimates on short character sums developed by Graham-Ringrose and Iwaniec, we improve the…

For each nonprincipal Dirichlet character $\chi$, let $n_\chi$ be the least $n$ with $\chi(n) \notin \{0,1\}$. We show that as the average of $n_\chi$ over all nonprincipal characters $\chi$ modulo $q$ is $\ell(q) + o(1)$, where $\ell(q)$…

A classical theorem of Paley asserts the existence of an infinite family of quadratic characters whose character sums become exceptionally large. In this paper, we establish an analogous result for characters of any fixed even order.…

Taking Shapiro's cyclic sums $\sum_{i=1}^n x_i/(x_{i+1}+x_{i+2})$ (assuming index addition mod $n$) as a starting point, we introduce a broader class of cyclic sums, called generalized Shapiro-Diananda sums, where the denominators are…

Let $M(x)$ be the length of the largest subinterval of $[1,x]$ which does not contain any sums of two squareful numbers. We prove a lower bound \[ M(x)\gg \frac{\ln x}{(\ln\ln x)^2} \] for all $x\geq 3$. The proof relies on properties of…

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…

Byte-level fallbacks for subword tokenization have become a common practice in large language models. In particular, it has been demonstrated to be incredibly effective as a pragmatic solution for preventing OOV, especially in the context…

We derive a simple proof, based on information theoretic inequalities, of an upper bound on the largest rates of $q$-ary $\overline{2}$-separable codes that improves recent results of Wang for any $q\geq 13$. For the case $q=2$, we recover…

Answering a question of J. Rosenberg, we construct the first examples of infinite characters on $GL_n(\mathbf{K})$ for a global field $\mathbf{K}$ and $n\geq 2.$ The case $n=2$ is deduced from the following more general result. Let $G$ a…

Let G be a finite group and N be a non-trivial normal subgroup of G, such that the average character degree of irreducible characters in Irr(G|N) is less than or equal to 16=5. Then we prove that N is solvable. Also, we prove the…

In this paper, we obtain a sharp upper bound for the sum of the first $k$-th eigenvalues for this Dirichlet problem of poly-Laplacian with any order, which is viewed as an extension of the result due to Cheng and Wei (Journal of…

We study the effect of resumming large logarithms in the determination of the bottom quark mass through a non-relativistic sum rule analysis. Our result is complete at next-to-leading-logarithmic accuracy and includes some known…