Related papers: Proof of Tomaszewski's Conjecture on Randomly Sign…
Let $\varepsilon_1,\ldots,\varepsilon_n$ be independent identically distributed Rademacher random variables, that is $\mathbb{P}\{\varepsilon_i=\pm1\}=1/2$. Let $S_n=a_1\varepsilon_1+\cdots+a_n\varepsilon_n$, where…
Under mild conditions on a family of independent random variables $(X_n)$ we prove that almost sure convergence of a sequence of tetrahedral polynomial chaoses of uniformly bounded degrees in the variables $(X_n)$ implies the almost sure…
The recent paper by I. Weissman, "Sum of squares of uniform random variables",[Statist. Probab. Lett. 129 (2017), 147-154] is compared to earlier work of B. Tibken and D. Constales relating to the area of the intersection of a centred ball…
We propose a new conjecture on some exponential sums. These particular sums have not apparently been considered in the literature. Subject to the conjecture we obtain the first effective construction of asymptotically good tree codes. The…
We obtained a $\psi_1$ estimate for the sum of Rademacher random variables under condition that they are dependent.
For a fixed alphabet $A$, an infinite sequence $X$ is said to be normal if every word $w$ over $A$ appears in $X$ with the same frequency as any other word of the same length. A classical result of Agafonov (1966) relates normality to…
The Krzy\.z conjecture concerns the largest values of the Taylor coefficients of a non-vanishing analytic function bounded by one in modulus in the unit disk. It has been open since 1968 even though information on the structure of extremal…
An analogue of the Berry-Esseen inequality is proved for the speed of convergence of free additive convolutions of bounded probability measures. The obtained rate of convergence is of the order n^{-1/2}, the same as in the classical case.…
Answering the question of V.I. Oseledets, we present a random variable $\xi$ such that the sum $\xi(x)+a\xi(y)$ has a singular distribution for a set of parameters $a$ dense in $(1, +\infty)$, but for another dense set of parameters, this…
The celebrated (First) Borwein Conjecture predicts that for all positive integers~$n$ the sign pattern of the coefficients of the ``Borwein polynomial'' $$(1-q)(1-q^2)(1-q^4)(1-q^5) \cdots(1-q^{3n-2})(1-q^{3n-1})$$ is $+--+--\cdots$. It was…
A conjecture of Graham (repeated by Erd\H{o}s) asserts that for any set $A \subseteq \mathbb{F}_p \setminus \{0\}$, there is an ordering $a_1, \ldots, a_{|A|}$ of the elements of $A$ such that the partial sums $a_1, a_1+a_2, \ldots,…
Let (X_n) be a sequence of random variables (with values in a separable metric space) and (N_n) a sequence of random indices. Conditions for X_{N_n} to converge stably (in particular, in distribution) are provided. Some examples, where such…
In this paper, we propose a new approach for deriving probabilistic inequalities. Our main idea is to exploit the information of underlying distributions by virtue of the monotone likelihood ratio property and Berry-Essen inequality.…
Let $X$ be a random variable and define its concentration function by $$\mathcal{Q}_{h}(X)=\sup_{x\in \mathbb{R}}\mathbb{P}(X\in (x,x+h]).$$ For a sum $S_n=X_1+\cdots+X_n$ of independent real-valued random variables the Kolmogorov-Rogozin…
Given a sequence $(X_n)$ of real or complex random variables and a sequence of numbers $(a_n)$, an interesting problem is to determine the conditions under which the series $\sum_{n=1}^\infty a_n X_n$ is almost surely convergent. This paper…
In this paper, a sum rule means a relationship between a functional defined on a subset of all probability measures on $\mathbb{R}$ involving the reverse Kullback-Leibler divergence with respect to a particular distribution and recursion…
Consider a random power series of the form $P(z) = \sum_{n\ge 1} \varepsilon_n a_n z^{n}$ where $a_n \in \mathbb{C}$ are deterministic and $\varepsilon_n$ are chosen independently and uniformly at random from $\{\pm 1\}$. Kolmogorov's…
Consider the following prediction problem. Assume that there is a block box that produces bits according to some unknown computable distribution on the binary tree. We know first $n$ bits $x_1 x_2 \ldots x_n$. We want to know the…
Let ~$\veps_1, ..., \veps_m$ be i.i.d. random variables with $$P(\veps_i=1)= P(\veps_i= -1)=1/2,$$ and $X_m = \sum_{i=1}^m \veps_i.$ Let $Y_m $ be a normal random variable with the same first two moments as that of $X_m.$ There is a…
We consider the problem of finding good low rank approximations of symmetric, positive-definite $A \in \mathbb{R}^{n \times n}$. Chen-Epperly-Tropp-Webber showed, among many other things, that the randomly pivoted partial Cholesky algorithm…