Related papers: Goldbach Numbers in Short Intervals -- A Nonnegati…
Str\"ombergsson and Venkatesh proved that a system of homogeneous linear congruence modulo prime has a positive probability to have a short non-trivial solution. We extend this result and show that the same holds for square-free moduli. In…
All sieve methods for the Goldbach problem sift out all the composite numbers; even though, strictly speaking, it is not necessary to do so and which is, in general, very difficult. Some new methods introduced in this paper show that the…
In this article we present method of solving some additive problems with primes. The method may be employed to the Goldbach-Euler conjecture and the twin primes conjecture. The presented method also makes it possible to obtain some…
We study a general class of multiplicative functions by relating "short averages" to its "long average". More precisely, we estimate asymptotically the variance of such a class of functions in short intervals using Fourier analysis and…
The document tries to put focus on sequences with certain properties and periods leading to the first value smaller than the starting value in the Collatz problem. With the idea that, if all starting numbers lead ultimately to a smaller…
We show several ways to round a real matrix to an integer one such that the rounding errors in all rows and columns as well as the whole matrix are less than one. This is a classical problem with applications in many fields, in particular,…
In this article we present very intuitive, easy to follow, yet mathematically rigorous, approach to the so called data fitting process. Rather than minimizing the distance between measured and simulated data points, we prefer to find such…
We study certain aspects of the Selberg sieve, in particular when sifting by rather thin sets of primes. We derive new results for the lower bound sieve suited especially for this setup and we apply them in particular to give a new…
In the present paper we study a non-modular variant of the Short Integer Solution problem over the integers. Given a random matrix $A \in \mathbb{Z}^{n\times m}$ with entries $a_{ij}$ such that $0\le a_{ij}< Q,$ for some $Q>0,$ the goal is…
We introduce a refinement of the GPY sieve method for studying prime $k$-tuples and small gaps between primes. This refinement avoids previous limitations of the method, and allows us to show that for each $k$, the prime $k$-tuples…
We propose a new formalism to analyse the extremum structure of scale-invariant effective potentials. The problem is stated in a compact matrix form, used to derive general expressions for the stationary point equation and the mass matrix…
We introduce a general result relating "short averages" of a multiplicative function to "long averages" which are well understood. This result has several consequences. First, for the M\"obius function we show that there are cancellations…
Importance sampling is a common technique for Monte Carlo approximation, including Monte Carlo approximation of p-values. Here it is shown that a simple correction of the usual importance sampling p-values creates valid p-values, meaning…
This paper describes how to specify probability models for data analysis via a backward induction procedure. The new approach yields coherent, prior-free uncertainty assessment. After presenting some intuition-building examples, the new…
In this paper, we develop a general theory of truncated inverse binomial sampling. In this theory, the fixed-size sampling and inverse binomial sampling are accommodated as special cases. In particular, the classical Chernoff-Hoeffding…
The auxiliary field method, defined through introducing an auxiliary (also called as the Hubbard-Stratonovich or the Mean-) field and utilizing a loop-expansion, gives an excellent result for a wide range of a coupling constant. The…
To prove that a measure, linearly representable by means of a finite set of nonnegative matrices $\mathcal M$, has the weak-Gibbs property, one check the uniform convergence (on $\mathcal M^\mathbb N$) of the sequence of vectors…
We analyze two recently proposed methods to establish a priori lower bounds on the minimum of general integral variational problems. The methods, which involve either `occupation measures' or a `pointwise dual relaxation' procedure, are…
Using the dual cone of sums of nonnegative circuits (SONC), we provide a relaxation of the global optimization problem to minimize an exponential sum and, as a special case, a multivariate real polynomial. Our approach builds on two key…
We consider solving nonconvex composite optimization problems in which the sum of a smooth function and a nonsmooth function is minimized. Many of convergence analyses of proximal gradient-type methods rely on global descent property…