Related papers: Maximum distance between consecutive primes and ot…
We investigate two asymptotic properties of a spatial preferential-attachment model introduced by E. Jacob and P. M\"orters (2013). First, in a regime of strong linear reinforcement, we show that typical distances are at most of…
We present effective upper bounds on the symmetric bilinear complexity of multiplication in extensions of a base finite field Fp2 of prime square order, obtained by combining estimates on gaps between prime numbers together with an optimal…
In this paper we establish explicit upper and lower bounds for the ratio of the arithmetic and geometric means of the prime numbers, which improve the current best estimates. Further, we prove several conjectures related to this ration…
We establish a general formula for the maximum size of finite length block codes with minimum pairwise distance no less than $d$. The achievability argument involves an iterative construction of a set of radius-$d$ balls, each centered at a…
We propose a new modified primal-dual proximal best approximation method for solving convex not necessarily differentiable optimization problems. The novelty of the method relies on introducing memory by taking into account iterates…
The set of short intervals between consecutive primes squared has the pleasant---but seemingly unexploited---property that each interval $s_k:=\{p_k^2, \dots,p_{k+1}^2-1\}$ is fully sieved by the $k$ first primes. Here we take advantage of…
We consider the sum of the reciprocals of the middle prime factor of an integer, defined according to multiplicity or not. We obtain an asymptotic expansion in the first case and an asymptotic formula involving an implicit parameter in the…
In this paper, we propose two novel non-stationary first-order primal-dual algorithms to solve nonsmooth composite convex optimization problems. Unlike existing primal-dual schemes where the parameters are often fixed, our methods use…
Consider error terms x(i) of a moving average process MA(q), where x(i)=e(i) + e(i-1)+...+e(i-q) and e(i) - independent identically distributed (i.i.d.) random variables. We recognize a term x(i) as a local maximum if the following…
The asymptotic rate vs. distance problem is a long-standing fundamental problem in coding theory. The best upper bound to date was given in 1977 and has received since then numerous proofs and interpretations. Here we provide a new,…
We prove a couple of related theorems including Legendre's and Andrica's conjecture. Key to the proofs is an algorithm that delivers the exact upper bound on the greatest gap that can occur in a combinatorial game with the set of P primes…
Comparison of two univariate distributions based on independent samples from them is a fundamental problem in statistics, with applications in a wide variety of scientific disciplines. In many situations, we might hypothesize that the two…
We obtain an explicit formula for the variance of the number of $k$-peaks in a uniformly random permutation. This is then used to obtain an asymptotic formula for the variance of the length of longest $k$-alternating subsequence in random…
Bounds and other relations involving variables connected with Carmichael numbers are reviewed and extended. Families of numbers or individual numbers attaining or approaching these bounds are given. A new algorithm for finding three-prime…
In this paper we study a one-parameter family of attractive reversible nearest particle system on a finite interval. As the length of the interval increases, the time that the nearest particle system first hits the empty set increases in…
We consider the distribution of the largest prime divisor of the integers in the interval $[2,x]$, and investigate in particular the mode of this distribution, the prime number(s) which show up most often in this list. In addition to giving…
It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes…
We consider a one dimensional ballistic random walk evolving in a parametric independent and identically distributed random environment. We study the asymptotic properties of the maximum likelihood estimator of the parameter based on a…
Consider a nearest-neighbor random walk with certain asymptotically zero drift on the positive half line. Let $M$ be the maximum of an excursion starting from $1$ and ending at $0.$ We study the distribution of $M$ and characterize its…
Convex nonsmooth optimization problems, whose solutions live in very high dimensional spaces, have become ubiquitous. To solve them, the class of first-order algorithms known as proximal splitting algorithms is particularly adequate: they…