Related papers: Explicit bounds for small prime nonresidues

We give explicit upper bounds for the coefficients of arbitrary weight $k$, level 2 cusp forms, making Deligne's well-known $O(n^{\frac{k-1}{2}+\epsilon})$ bound precise. We also derive asymptotic formulas and explicit upper bounds for the…

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…

For $m,q \in \mathbb{N}$, we call an $m$-tuple $(a_1,\ldots,a_m) \in \prod_{i=1}^m (\mathbb{Z}/q\mathbb{Z})^\times$ good if there are infinitely many consecutive primes $p_1,\ldots,p_m$ satisfying $p_i \equiv a_i \pmod{q}$ for all $i$. We…

Assuming the generalized Riemann hypothesis, we evaluate sharp upper bounds for the shifted moments of quadratic Dirichlet L-functions with moduli 8p, where p ranges over odd primes. We then apply this result to prove bounds for the moments…

Let $q$ be a large prime number, $a$ be any integer, $\epsilon$ be a fixed small positive quantity. Friedlander and Shparlinksi \cite{FSh} have shown that there exists a positive integer $n\ll q^{5/2+\epsilon}$ such that $\phi(n)$ falls…

Let $G$ be a $p$-group and let $\chi$ be an irreducible character of $G$. The codegree of $\chi$ is given by $|G:\text{ker}(\chi)|/\chi(1)$. Du and Lewis have shown that a $p$-group with exactly three codegrees has nilpotence class at most…

Let $L(s,\chi)$ be the Dirichlet $L$-function associated to a non-principal primitive character $\chi$ modulo $q$ with $3\le q \le 400\,000$. We prove a new explicit zero-free region for $L(s,\chi)$: $L(s,\chi)$ does not vanish in the…

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$,…

Given a large finite point set, $P\subset \mathbb R^2$, we obtain upper bounds on the number of triples of points that determine a given pair of dot products. That is, for any pair of positive real numbers, $(\alpha, \beta)$, we bound the…

Let $E$ be an elliptic curve of rank $\text{rk}(E) \geq 1$, and let $P \in E(\mathbb{Q})$ be a point of infinite order. The number of elliptic primes $p \leq x$ for which $\langle P\rangle=E(\mathbb{F}_p)$ is expected to be…

We prove that for any prime $p$ there is a divisible by $p$ number $q = O(p^{30})$ such that for a certain positive integer $a$ coprime with $q$ the ratio $a/q$ has bounded partial quotients. In the other direction we show that there is an…

Let $p_{n}$ denote the $n$th prime and for any fixed positive integer $k$ and $X\geq 2$, put \[ G_{k}(X):=\max _{p _{n+k}\leq X} \min \{ p_{n+1}-p_{n}, \ldots , p_{n+k}-p_{n+k-1} \}. \] Ford, Maynard and Tao proved that there exists an…

For a nonprincipal character $\chi$ modulo $D$, when $x\ge D^{\frac56+\varepsilon}$, $(l,D) = 1$, we prove a nontrivial estimate of the form $\sum_{n\le x}\Lambda (n)\chi (n-l)\ll x\exp\left(-0.6\sqrt{\ln D}\right)$ for the sum of values of…

For $k\ge 2$ even, let $d_{k,N}$ denote the dimension of the largest simple Hecke submodule of $S_{k}(\Gamma_0(N); \mathbb{Q})^\text{new}$. We show, using a simple analytic method, that $d_{k,N} \gg_k \log\log N / \log(2p)$ with $p$ the…

In this paper we study some products related to quadratic residues and quartic residues modulo primes. Let $p$ be an odd prime and let $A$ be any integer. We mainly determine completely the product $$f_p(A):=\prod_{1\le i,j\le(p-1)/2\atop…

Let $S_n$ denote a symmetric group, $\chi$ an irreducible character of $S_n$, and $g\in S_n$ an element which decomposes into $k$ disjoint cycles, where $1$-cycles are included. Then $|\chi(g)|\le k!$, and this upper bound is sharp for…

We estimate from below the lower density of the set of prime numbers p such that p-1 has a prime factor of size at least p^c, where c lies in between 1/4 and 1/2. We also establish upper and lower bounds on the counting function of the set…

We prove lower bounds for the number of primes $p \leq N + b$ such that $p-b$ is divisible by $2^{k(N)}$ and has at most $k$ odd prime factors ($k \geq 2$), assuming $2^{k(N)} \leq N^\theta$ for some $\theta > 0$ depending on $k$. The proof…

Let $\mathcal{P}$ be the set of all primes and $\pi(x)$ be the number of primes up to $x$. For any $n\ge 2$, let $P^+(n)$ be the largest prime factor of $n$. For $0<c<1$, let $$T_c(x)=\#\{p\le x:p\in \mathcal{P},P^+(p-1)\ge p^c\}.$$ In this…

For any irreducible character $\chi$ of a finite group $G$, let $\theta(\chi)$ denote the proportion of elements $g\in G$ for which $\chi(g)$ is either zero or a root of unity. Then for any $L\in[1/2,1]$ and any $\epsilon>0$, there exists…