Related papers: Effective estimates for some functions defined ove…
We prove an isomorphism between the finite domain from 1 up to the product of the first n primes and the new defined set of prime modular numbers. This definition provides some insights about relative prime numbers. We provide an inverse…
Let $\psi_{\mathbb K}$ be the Chebyshev function of a number field $\mathbb K$. Let $\psi^{(1)}_{\mathbb K}(x):=\int_{0}^{x}\psi_{\mathbb K}(t)\,d t$ and $\psi^{(2)}_{\mathbb K}(x):=2\int_{0}^{x}\psi^{(1)}_{\mathbb K}(t)\,d t$. We prove…
We establish two new estimates which control a function (after subtracting its average) in $L^1$ by only the $L^1$ norm of its radial derivative. While the interior estimate holds for all superharmonic functions, the boundary version is…
Finite sample bounds on the estimation error of the mean by the empirical mean, uniform over a class of functions, can often be conveniently obtained in terms of Rademacher or Gaussian averages of the class. If a function of n variables has…
Extended real-valued functions are often used in optimization theory, but in different ways for infimum problems and for supremum problems. We present an approach to extended real-valued functions that works for all types of problems and…
We investigate the existence of bounded-memory consistent estimators of various statistical functionals. This question is resolved in the negative in a rather strong sense. We propose various bounded-memory approximations, using techniques…
In this paper we propose an algorithm that correctly discards a set of numbers (from a previously defined sieve) with an interval of integers. Leopoldo's Theorem states that the remaining integer numbers will generate and count the complete…
The approximation of integral type functionals is studied for discrete observations of a continuous It\^o semimartingale. Based on novel approximations in the Fourier domain, central limit theorems are proved for $L^2$-Sobolev functions…
Ferrers diagrams are used to visually represent integer partitions. We describe a way to use Ferrers diagrams to uniquely represent integers in terms of their prime factors. This leads to a lower bound on the number of primes less than a…
A hypothesis is put forward regarding the function $\pi_2(x)$ which describes the distribution of twin primes in the set of natural numbers. The function $\pi_2(x)$ is tested by evaluation and an empirical $\pi_2^{\ast}(x)$ is arrived at,…
We prove explicit upper bounds for weighted sums over prime numbers in arithmetic progressions with slowly varying weight functions. The results generalize the well-known Brun-Titchmarsh inequality.
Let $\psi_\K$ be the Chebyshev function of a number field $\K$. Under GRH we prove an explicit upper bound for $|\psi_\K(x)-x|$ in terms of the degree and the discriminant of $\K$. The new bound improves significantly on previous known…
The main results extend to sums over primes in a short interval earlier estimates by the author for "long" Weyl sums over primes.
We provide new sufficient conditions for Chebyshev estimates for Beurling generalized primes. It is shown that if the counting function $N$ of a generalized number system satisfies the $L^{1}$-condition $$…
In this paper, we establish an asymptotic formula with an effective bound on the error term for the Andrews smallest parts function $\mathrm{spt}(n)$. We use this formula to prove recent conjectures of Chen concerning inequalities which…
Consider a class of functions of one real variable with the following uniqueness property: if a function f(x) from the class vanishes on a set of positive measure, then f is the zero function. In many instances, we would like to have a…
We study the average distribution of primes of size $x$ in arithmetic progressions to moduli larger than $x^{\frac{1}{2}}$. Using arithmetic information from the works of many authors together with different variants of the original…
We consider a wide class of the discrete optimization problems with interval objective function. We give a generalization of the greedy algorithm for the problems. Using the algorithm, we obtain the set of all possible greedy solutions and…
A semiprime is a natural number which can be written as the product of two primes. The asymptotic behaviour of the function $\pi_2(x)$, the number of semiprimes less than or equal to $x$, is studied. Using a combinatorial argument,…
We present a simple, closed formula which gives all the primes in order. It is a simple product of integer floor and ceiling functions.