Related papers: Large Sums of High Order Characters

We generalize current known distribution results on Shanks--R\'enyi prime number races to the case where arbitrarily many residue classes are involved. Our method handles both the classical case that goes back to Chebyshev and function…

An explicit formula for the quadratic mean value at $s=1$ of the Dirichlet $L$-functions associated with the odd Dirichlet characters modulo $f>2$ is known. Here we present a situation where we could prove an explicit formula for the…

We study a multiplicative function analogue of Linnik's problem on the least prime in an arithmetic progression. Let $h\colon \mathbb{N}\to\mathbb{R}\setminus\{0\}$ be a multiplicative function, and let $a \pmod q$ be a reduced residue…

Let $Q_n$ denote a random symmetric $n$ by $n$ matrix, whose upper diagonal entries are i.i.d. Bernoulli random variables (which take values 0 and 1 with probability 1/2). We prove that $Q_n$ is non-singular with probability…

Fix natural numbers $n \geq 1$, $t \geq 2$ and a primitive $t^{\text{th}}$ root of unity $\omega$. In previous work with A. Ayyer (J. Alg., 2022), we studied the factorization of specialized irreducible characters of $\text{GL}_{tn}$,…

Dirichlet's Lemma states that every primitive quadratic Dirichlet character $\chi$ can be written in the form $\chi(n) = (\frac{\Delta}n)$ for a suitable quadratic discriminant $\Delta$. In this article we define a group, the separant class…

For $\alpha, \beta, \delta \in [0,1], \alpha +\beta = 1 $ we consider sets $$ {\rm BAD}^* (\alpha, \beta ;\delta) = \left\{\xi = (\xi_1,\xi_2) \in [0,1]^2: ,\inf_{p\in \mathbb{N}} \max \{(p\log(p+1))^\alpha ||p\xi_1||, (p\log (p+1))^\beta…

Let $\Omega$ be a matrix with entries $a_{i,j}=\omega^{ij},$ $1\leq i,j \leq n,$ where $\omega=e^{2\pi \sqrt{-1}/n},$ $n\in \mathbb N.$ The Chebotarev theorem states that if $n$ is a prime then any minor of $\Omega$ is non-zero. In this…

We consider Dirichlet $L$-functions $L(s, \chi)$ where $\chi$ is a real, non-principal character modulo $q$. Using Pintz's refinement of Page's theorem, we prove that for $q\geq 3$ the function $L(s, \chi)$ has at most one real zero $\beta$…

We show that for every $0 < \epsilon \leq 1$ and integer $k\geq 1$, there exists an integer $n = n(\epsilon,k)$ so that for all primes $p$, and integers $0 \leq a \leq p-1$, there exist integers $1 \leq x_1 < ... < x_n \leq p^\epsilon$ such…

Let $d\geq 2$ and $k\geq 1$ be fixed. We prove that, for every $\epsilon>0$ and every real $\beta$, there exist integers $1\leq b_1,\ldots,b_k\leq N$ such that \[ \left\|\sum_{j=1}^k b_j^{1/d}-\beta\right\| \ll_{d,k,\epsilon}…

We prove prime exponential sums have no better than square root cancellation on average on short intervals, in the sense that $$\frac{1}{x} \sum_{-y< n\le x} \left|\sum_{\substack{n< m \le n+y\\ 1\le m \le x}} \Lambda(m) \mathrm{e}(\alpha…

We show that the problem of finding the simplex of largest volume in the convex hull of $n$ points in $\mathbb{Q}^d$ can be approximated with a factor of $O(\log d)^{d/2}$ in polynomial time. This improves upon the previously best known…

We prove large sieve inequalities with multivariate polynomial moduli and deduce a general Bombieri--Vinogradov type theorem for a class of polynomial moduli having a sufficient number of variables compared to its degree. This sharpens…

We consider the probability that the random signed sum $\xi_1 v_1 + \dotsb + \xi_n v_n$ lies within a given distance $r$ of the origin, where $v_1,\dotsc,v_n \in \mathbb{R}^d$ are fixed unit vectors and $\xi_1,\dotsc,\xi_n$ are…

We prove that, if $m,n\geqslant 1$ and $a_1,\ldots,a_m$ are nonnegative integers, then \begin{align*} \frac{[a_1+\cdots+a_m+1]!}{[a_1]!\ldots[a_m]!}\sum^{n-1}_{h=0}q^h\prod_{i=1}^m{h\brack a_i} \equiv 0\pmod{[n]}, \end{align*} where…

We prove that with high probability over the choice of a random graph $G$ from the Erd\H{o}s-R\'enyi distribution $G(n,1/2)$, the $n^{O(d)}$-time degree $d$ Sum-of-Squares semidefinite programming relaxation for the clique problem will give…

We prove a \emph{query complexity} lower bound on rank-one principal component analysis (PCA). We consider an oracle model where, given a symmetric matrix $M \in \mathbb{R}^{d \times d}$, an algorithm is allowed to make $T$ \emph{exact}…

The deep theory of approximate subgroups establishes 3-step product growth for subsets of finite simple groups $G$ of Lie type of bounded rank. In this paper we obtain 2-step growth results for representations of such groups $G$ (including…

Let P denote the set of all primes. Suppose that P_1, P_2, P_3 are three subsets of P with the sum of their lower densities relative to P is greater than 2. We prove that for sufficiently large odd integer n, there exist p_i\in P_i such…