Related papers: Primes in arithmetic progressions and semidefinite…

We give the converse to Dirichlet's theorem on primes in arithmetic progressions by generalizing an old result of Guinand.

Let $\chi$ be a Dirichlet character mod $D$ with $L(s,\chi)$ its associated $L$-function, and let $\psi(x,q,a)$ be Chebyshev's prime-counting function for primes congruent to $a$ modulo $q$. We show that under the assumption of an…

An original approach to solving rather difficult probabilistic problems arising in studying the readout of random discrete fields and having no exact analytical solutions at the moment is proposed. Several algorithms for direct, iterative,…

This paper gives an explicit version of Selberg's 1943 mean-value estimate for the prime number theorem in intervals under the Riemann hypothesis. Two applications are given: for primes in short intervals, and Goldbach numbers (sums of two…

Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…

We extend the classical primal-dual interior point method from the Euclidean setting to the Riemannian one. Our method, named the Riemannian interior point method, is for solving Riemannian constrained optimization problems. We establish…

Let $a_0\in\{0,\dots,9\}$. We show there are infinitely many prime numbers which do not have the digit $a_0$ in their decimal expansion. The proof is an application of the Hardy-Littlewood circle method to a binary problem, and rests on…

We derive an asymptotic formula for the divisor function $\tau(k)$ in an arithmetic progression $k\equiv a(\bmod \ q)$, uniformly for $q\leq X^{\Delta_{n,l}}$ with $(q,a)=1$. The parameter $\Delta_{n,l}$ is defined as $$…

Under two assumptions, we determine the distribution of the difference between two functions each counting the numbers < x that are in a given arithmetic progression modulo q and the product of two primes. The two assumptions are (i) the…

We establish a new asymptotic formula for the number of polynomials of degree $n$ with $k$ prime factors over a finite field $\mathbb{F}_q$. The error term tends to $0$ uniformly in $n$ and in $q$, and $k$ can grow beyond $\log n$.…

This paper deals with approximate solutions of a nonsmooth semi-infinite programming with multiple interval-valued objective functions. We first introduce four types of approximate quasi Pareto solutions of the considered problem by…

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(x,t)$ satisfy the Dirichlet initial-boundary value problem for the nonlinear Schr\"odinger equation on the finite interval, $0 < x < L$, with $q_{0}(x) = q(x,0)$, $g_{0}(t) = q(0,t)$, $f_{0}(t) = q(L,t)$. Let $g_{1}(t)$ and…

For an irrational $\alpha\in \mathbb{R}$, we consider additive problems with the set of primes satisfying $\lVert\alpha p\rVert\leq \frac{1}{p^\tau}$ for some fixed $\tau>0$. In particular, we show that there exist infinitely many…

We present the formalization of Dirichlet's theorem on the infinitude of primes in arithmetic progressions, and Selberg's elementary proof of the prime number theorem, which asserts that the number $\pi(x)$ of primes less than $x$ is…

The problems of optimally estimating a phase, a direction, and the orientation of a Cartesian frame (or trihedron) with general pure states are addressed. Special emphasis is put on estimation schemes that allow for inconclusive answers or…

It is developed the theory of the boundary behavior of homeomorphic solutions of the Beltrami equations ${\bar{\partial}}f=\mu\,{\partial}f$ of the Sobolev class $W^{1,1}_{\rm loc}$ with respect to prime ends of domains. On this basis,…

Inspired by classical sensitivity results for nonlinear optimization, we derive and discuss new quantitative bounds to characterize the solution map and dual variables of a parametrized nonlinear program. In particular, we derive explicit…

A 1976 result from Norton may be used to give an asymptotic (but not explicit) description of the constant in Mertens' second theorem for primes in arithmetic progressions. Assuming the Generalized Riemann Hypothesis, we give an effective…

We study the distribution of partition parts in arithmetic progressions and find asymptotic results that capture all exponentially growing terms. This is accomplished by studying the behavior of non-modular Eisenstein series that appear in…