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

An explicit hybrid estimate for $L(1/2+it,\chi)$ is derived, where $\chi$ is a Dirichlet character modulo $q$. The estimate applies when $t$ is bounded away from zero, and is most effective when $q$ is powerfull, yielding an explicit Weyl…

We show a nearly optimal lower bound on the length of linear relaxed locally decodable codes (RLDCs). Specifically, we prove that any $q$-query linear RLDC $C\colon \{0,1\}^k \to \{0,1\}^n$ must satisfy $n = k^{1+\Omega(1/q)}$. This bound…

It is well known that the weak ($1,1$) bounds doesn't hold for the strong maximal operators, but it still enjoys certain weak $L\log L$ type norm inequality. Let $\Phi_n(t)=t(1+(\log^+t)^{n-1})$ and the space $L_{\Phi_n}({\mathbb R^{n}})$…

We consider the problem of $\Omega$ bounds for the partial sums of a modified character, \textit{i.e.}, a completely multiplicative function $f$ such that $f(p)=\chi(p)$ for all but a finite number of primes $p$, where $\chi$ is a primitive…

We prove a quantitative uncertainty principle at low energies for the Laplacian on fairly general weighted graphs with a uniform explicit control of the constants in terms of geometric quantities. A major step consists in establishing lower…

We study the relation between the size of $L(1,\chi)$ and the width of the zero-free interval to the left of that point.

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…

Lower and upper bounds for a given function are important in many mathematical and engineering contexts, where they often serve as a base for both analysis and application. In this short paper, we derive piecewise linear and quadratic…

We establish an upper bound of the sum of the eigenvalues for the Dirichlet problem of the fractional Laplacian. Our result is obtained by a subtle computation of the Rayleigh quotient for specific functions.

We show, for any $q\ge 3$ and distinct reduced residues $a,b \pmod q$, the existence of certain hypothetical sets of zeros of Dirichlet $L$-functions lying off the critical line implies that $\pi(x;q,a)<\pi(x;q,b)$ for a set of real $x$ of…

We consider the $L^q$-mixed problem in domains in ${\bf R}^n$ with $C^ {1,1}$-boundary. We assume that the boundary between the sets where we specify Neumann and Dirichlet data is Lipschitz. With these assumptions, we show that we may solve…

For a primitive Dirichlet character $\chi\pmod q$ we let \[M(\chi):= \frac{1}{\sqrt{q}}\max_{1\leq t \leq q} \Big|\sum_{n \leq t} \chi(n) \Big|.\] In this paper, we investigate the distribution of $M(\chi)$, as $\chi$ ranges over primitive…

Let $\chi$ be a non-principal Dirichlet character and $L(s, \chi)$ be the associated Dirichlet $L$-function. Let us use $\mathcal{L}(s,\chi)$ to denote its logarithmic derivative $L'(s, \chi)/L(s, \chi)$. We first prove some arithmetic…

There is a constant c > 0 such that for every $\epsilon \in (0,1)$ and $n \geq 1/\epsilon^2$, the following holds. Any mapping from the $n$-point star metric into $\ell_1^d$ with bi-Lipschitz distortion $1+\epsilon$ requires dimension $$d…

We study upper bounds for sums of Dirichlet characters. We prove a uniform upper bound of the character sum over all proper generalized arithmetic progressions, which generalizes the classical Polya and Vinogradov inequality. Our argument…

Two upper bounds on the minimum distance of type-1 quasi-cyclic low-density parity-check (QC LDPC) codes are derived. The necessary condition is given for the minimum code distance of such codes to grow linearly with the code length.

Let $\chi$ be a primitive Dirichlet character modulo $q$ and $L(s,\chi)$ be the Dirichlet L-function associated to $\chi$. Using a new two-piece mollifier we show that $L(\tfrac{1}{2},\chi)\ne0$ for at least 34% of the characters in the…

We establish an upper bound on the multiplicity of eigenvalues of the Sch\"odinger-Dirichlet operator in dimension two. We give a proof based on a generalized Morse Lemma due to Cheng \cite{Ch}.

We prove an upper bound of $n+9$ for the strong separation number of the complete graph $K_n$, and an upper bound of $n+1$ for its weak separation number. This improves on the previous best known bound of $(1+o(1))n$ for both cases.

We show that as the ratio between the first Dirichlet eigenvalues of a convex domain and of the ball with the same volume becomes large, the same must happen to the corresponding ratio of isoperimetric constants. The proof is based on the…