Related papers: A remark on the majorant property for random sets
Using changes of probability measure developed by \mbox{Grama} and Haeusler (Stochastic Process.\ Appl., 2000), we obtain two generalizations of the deviation inequalities of Lanzinger and Stadtm\"{u}ller (Stochastic Process.\ Appl., 2000)…
For a fixed rational number g and integers a and d the sets N_g(a,d), respectively R_g(a,d), of primes p for which the order, respectively the index of g(mod p) is congruent to a(mod d), are considered. Under the Generalized Riemann…
We generalize to the case of the $p-$Laplacian an old result by Hersch and Protter. Namely, we show that it is possible to estimate from below the first eigenvalue of the Dirichlet $p-$Laplacian of a convex set in terms of its inradius. We…
There are considered some corollaries of certain hypotheses on the observation process of microphenomena. We show that an enlargement of the phase space and of its motion group and an account for the diffusion motions of microsystems in the…
In algorithmic randomness, when one wants to define a randomness notion with respect to some non-computable measure $\lambda $, a choice needs to be made. One approach is to allow randomness tests to access the measure $\lambda $ as an…
We investigate random compact sets with random functions defined thereon, such as polynomials, rational functions, the pluricomplex Green function and the Siciak extremal function. One surprising consequence of our study is that randomness…
The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…
We describe recent advances in the study of random analogues of combinatorial theorems.
We study the statistical properties of random numbers under the Martin-L\"of definition of randomness, proving that random numbers obey analogues of Strong Law of Large Numbers, the Law of the Iterated Logarithm, and that they are normal.…
We present some results concerning the almost sure behaviour of the operator norm or random Toeplitz matrices, including the law of large numbers for the norm, normalized by its expectation (in the i.i.d. case). As tools we present some…
We cosider random dynamical systems with randomly chosen jumps. The choice of deterministic dynamical system and jumps depends on a position. We proove the existence of an exponentially attractive invariant measure and the strong law of…
We aim at estimating a function $\lambda:[0,1]\to \mathbb {R}$, subject to the constraint that it is decreasing (or increasing). We provide a unified approach for studying the $\mathbb {L}_p$-loss of an estimator defined as the slope of a…
We prove character sum estimates for additive Bohr subsets modulo a prime. These estimates are analogous to classical character sum bounds of Polya-Vinogradov and Burgess. These estimates are applied to obtain results on recurrence mod $p$…
In this note we present a method to bound gaps between primes via the divergence of the series of reciprocals of the prime numbers, a consequence of a version of the Bertrand's test for convergence of series of positive numbers and a…
For integer $q$, let $\chi$ be a primitive multiplicative character$\pmod q.$ For integer $a$ coprime to $q$, we obtain a new bound for the sums $$\sum_{n\le N}\Lambda(n)\chi(n+a),$$ where $\Lambda(n)$ is the von Mangoldt function. This…
We discuss recent results of the replica approach to statistical mechanics of a single classical particle placed in a random N(>>1)-dimensional Gaussian landscape. The particular attention is paid to the case of landscapes with…
We introduce the logics GLP(\Lambda), a generalization of Japaridze's polymodal provability logic GLP(\omega) where \Lambda is any linearly ordered set representing a hierarchy of provability operators of increasing strength. We shall…
We continue the research of Lata{\l}a on improving estimates of $p$-th moments of sums of independent random variables. We generalize some of his results in the case when $2 \leq p \leq 4$ and present a combinatorial approach for even…
The problem of guessing a random string is revisited. A close relation between guessing and compression is first established. Then it is shown that if the sequence of distributions of the information spectrum satisfies the large deviation…
We consider the action of Mandelbrot multiplicative cascades on probability measures supported on a symbolic space. For general probability measures, we obtain almost a sharp criterion of non-degeneracy of the limiting measure; it relies on…