Related papers: Conditional upper bounds on the least character no…
We obtain (conditional and unconditional) results on large values of $L$-functions $L(s,\chi)$ in the critical strip $1/2 \leq \Re s \leq 1$ when the character $\chi$ runs through a thin subgroup of all characters modulo an integer $q$.…
We obtain nontrivial bounds for character sums with multiplicative and additive characters over finite fields over elements with restricted coordinate expansion. In particular, we obtain a nontrivial estimate for such a sum over a finite…
This paper studies explicit and theoretical bounds for several interesting quantities in number theory, conditionally on the Generalized Riemann Hypothesis. Specifically, we improve the existing explicit bounds for the least quadratic…
Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…
We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.
Assuming the Riemann Hypothesis, we provide effective upper and lower estimates for $\left|\zeta(s)\right|$ right to the critical line. As an application we make explicit Titchmarsh's conditional bound for the Mertens function and…
A proof for the lower bound is provided for the smallest eigenvalue of finite element equations with arbitrary conforming simplicial meshes. The bound has a similar form as the one by Graham and McLean [SIAM J. Numer. Anal., 44 (2006), pp.…
Let $p\geq3$ be a large prime and let $n(p)\geq2$ denotes the least quadratic nonresidue modulo $p$. This note sharpens the standard upper bound of the least quadratic nonresidue from the unconditional upper bound $n(p)\ll…
We improve known upper bounds for the minimal dispersion of a point set in the unit cube and its inverse in both the periodic and non-periodic settings. Some of our bounds are sharp up to logarithmic factors.
We present upper bounds on certain sums which are related to Artin's primitive root conjecture and are also used in counting ray class characters.
Let $F$ be a number field, and let $\pi_1$ and $\pi_2$ be distinct unitary cuspidal automorphic representations of $\operatorname{GL}_{n_1}(\mathbb{A}_F)$ and $\operatorname{GL}_{n_2}(\mathbb{A}_F)$ respectively. In this paper, we derive…
This article derives lower bounds on the supremal (strict) p-negative type of finite metric spaces using purely elementary techniques. The bounds depend only on the cardinality and the (scaled) diameter of the underlying finite metric…
It is well-known that cancellation in short character sums (e.g. Burgess' estimates) yields bounds on the least quadratic nonresidue. Scant progress has been made on short character sums since Burgess' work, so it is desirable to find a new…
The problem of finding upper bounds for L-functions at the edge of the critical strip has a long and interesting history. Here, the situation for classical L-functions such as Dirichlet L-functions is relatively well understood. The reason…
We introduce the nonlocal analogue of the classical free boundary minimal hypersurfaces in an open domain $\Omega$ of $\mathbb{R}^n$ as the (boundaries of) critical points of the fractional perimeter $\operatorname{Per}_s(\cdot,\,\Omega )$…
We present an explicit formula for subregular characters (i.e, irreducible finite-dimensional complex characters of submaximal degree) of the unitriangular group over a finite field of sufficiently large characteristic.
An explicit upper bound is established for the least non-trivial integer zero of an arbitrary cubic form $C \in \mathbb{Z}[X_1,...,X_n],$ provided that $n \geq 14.$
New asymptotic upper bounds are presented on the rate of sequences of locally repairable codes (LRCs) with a prescribed relative minimum distance and locality over a finite field $F$. The bounds apply to LRCs in which the recovery functions…
We describe a robust methodology, based on the martingale argument of Nachmias and Peres and random walk estimates, to obtain simple upper and lower bounds on the size of a maximal component in several random graphs \textit{at criticality}.…
A coordinate-free proof of the Maximum Principle is provided in the specific case of an optimal control problem with fixed time. Our treatment heavily relies on a special notion of variation of curves that consist of a concatenation of…