English
Related papers

Related papers: Upper bounds for |L(1,chi)|

200 papers

It is known, that under the assumption of the generalized Riemannian hypothesis, the function $\pi(x, q, 1) - \pi(x, q, a)$ has infinitely many sign changes. In this article we give an upper bound for the least such sign change. Similarly,…

Number Theory · Mathematics 2011-05-10 Jan-Christoph Schlage-Puchta

Let $\pi$ be a Hecke-Maass cusp form for $SL(3,\mathbb{Z})$ and $\chi=\chi_1\chi_2$ a Dirichlet character with $\chi_i$ primitive modulo $M_i$. Suppose that $M_1$, $M_2$ are primes such that $\max\{(M|t|)^{1/3+2\delta/3},M^{2/5}|t|^{-9/20},…

Number Theory · Mathematics 2017-05-03 Qingfeng Sun

We provide explicit upper bounds of the order $\log t/\log\log t$ for $|\zeta'(s)/\zeta(s)|$ and $|1/\zeta(s)|$ when $\sigma$ is close to $1$. These improve existing bounds for $\zeta(s)$ on the $1$-line.

Number Theory · Mathematics 2024-06-27 Michaela Cully-Hugill , Nicol Leong

Suppose that $M$ is a compact Riemannian manifold with boundary and $u$ is an $L^2$-normalized Dirichlet eigenfunction with eigenvalue $\lambda$. Let $\psi$ be its normal derivative at the boundary. Scaling considerations lead one to expect…

Analysis of PDEs · Mathematics 2007-05-23 Andrew Hassell , Terence Tao

Assuming the Generalized Riemann Hypothesis, it is known that at least half of the central values $L(\frac{1}{2},\chi)$ are non-vanishing as $\chi$ ranges over primitive characters modulo $q$. Unconditionally, this is known on average over…

Number Theory · Mathematics 2025-11-11 Debmalya Basak

Pach showed that every $d+1$ sets of points $Q_1,\dotsc,Q_{d+1} \subset \mathbb{R}^d$ contain linearly-sized subsets $P_i\subset Q_i$ such that all the transversal simplices that they span intersect. We show, by means of an example, that a…

Combinatorics · Mathematics 2019-11-20 Boris Bukh , Alfredo Hubard

We establish an asymptotic formula for the first moment and derive an upper bound for the second moment of L-functions associated with the complete family of primitive cubic Dirichlet characters defined over the Eisenstein field. Our…

Number Theory · Mathematics 2023-06-27 Ahmet Muhtar Güloğlu

We give a new estimate on the lower bound for the first Dirichlet eigenvalue for a compact manifold with positive Ricci curvature in terms of the in-diameter and the lower bound of the Ricci curvature. The result improves the previous…

Differential Geometry · Mathematics 2007-05-23 Jun Ling

We describe two new algorithms for the efficient and rigorous computation of Dirichlet L-functions and their use to verify the Generalised Riemann Hypothesis for all such L-functions associated with primitive characters of modulus…

Number Theory · Mathematics 2013-05-15 David J. Platt

We characterize all (absolute) 1-Lipschitz retracts Q of R^n with the maximum norm. Omitting two technical details, they coincide with the subsets written as the solution set of (at most) 2n inequalities like follows. For every coordinate…

Metric Geometry · Mathematics 2015-10-15 Dominic Descombes

The Brun-Titchmarsh theorem shows that the number of primes $\le x$ which are congruent to $a\pmod{q}$ is $\le (C+o(1))x/(\phi(q)\log{x})$ for some value $C$ depending on $\log{x}/\log{q}$. Different authors have provided different…

Number Theory · Mathematics 2012-05-22 J. Maynard

In this short note we determine the greatest lower bounds on Ricci curvature for all Fano $T$-manifolds of complexity one, generalizing the result of Chi Li. Our method of proof is based on the work of Datar and Sz\'ekelyhidi, using the…

Differential Geometry · Mathematics 2018-10-03 Jacob Cable

Upper and lower bounds are given for the maximum Euclidean curvature among faces in Bianchi's fundamental polyhedron for $PSL_2(O)$ in the upper-half space model of hyperbolic space, where $O$ is an imaginary quadratic ring of integers with…

Number Theory · Mathematics 2022-05-31 Daniel E. Martin

We present new upper bounds on the parameters of batch codes with restricted query size. These bounds are an improvement on the Singleton bound. The techniques for derivations of these bounds are based on the ideas in the literature for…

Information Theory · Computer Science 2016-02-10 Hui Zhang , Vitaly Skachek

Lower bounds for some explicit decision problems over the complex numbers are given.

Numerical Analysis · Mathematics 2025-10-20 Gregorio Malajovich

We study non-vanishing of Dirichlet $L$-functions at the central point under the unlikely assumption that there exists an exceptional Dirichlet character. In particular we prove that if $\psi$ is a real primitive character modulo $D \in…

Number Theory · Mathematics 2023-12-13 Martin Čech , Kaisa Matomäki

A basic problem for constant dimension codes is to determine the maximum possible size $A_q(n,d;k)$ of a set of $k$-dimensional subspaces in $\mathbb{F}_q^n$, called codewords, such that the subspace distance satisfies…

Information Theory · Computer Science 2022-12-22 Sascha Kurz

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…

Representation Theory · Mathematics 2024-11-14 Michael Larsen

Let $f\in S_k(N,\psi)$ be a newform, and let $\chi$ be a primitive character of conductor $q^{\ell}$. Assume that $q$ is a prime and $\ell>1$. In this paper we describe a method to establish convexity breaking bounds of the form $$…

Number Theory · Mathematics 2012-03-06 Ritabrata Munshi

We study an approximate version of $q$-query LDCs (Locally Decodable Codes) over the real numbers and prove lower bounds on the encoding length of such codes. A $q$-query $(\alpha,\delta)$-approximate LDC is a set $V$ of $n$ points in…

Computational Complexity · Computer Science 2014-02-28 Jop Briët , Zeev Dvir , Guangda Hu , Shubhangi Saraf