Related papers: Possible probability and irreducibility of balance…
The purpose of this paper is to analyze certain statistics of a recently introduced non-uniform random tree model, biased recursive trees. This model is based on constructing a random tree by establishing a correspondence with non-uniform…
We present for every $n\ge4$ an $n$-player game in normal form with payoffs in $\{0,1,2\}$ that has a unique, fully mixed, Nash equilibrium in which all the probability weights are irradical (i.e., algebraic but not closed form expressible…
Let $\mathcal{P}=\{p_1,p_2,...\}$ be the set of all odd primes arranged in increasing order. A Goldbach partition of the even integer $2k>4$ is a way of writing it as a sum of two primes from $\mathcal{P}$ without regard to order. Let…
We study the generalization of the game Lights Out in which the standard square grid board is replaced by a graph. We examine the probability that, when a graph is chosen uniformly at random from the set of graphs with $n$ vertices and $e$…
Necessary and sufficient conditions of uniform consistency are explored. A hypothesis is simple. Nonparametric sets of alternatives are bounded convex sets in $\mathbb{L}_p$, $p >1$ with "small" balls deleted. The "small" balls have the…
The rules of a game of dice are extended to a "hyper-die" with $n\in\mathbb{N}$ equally probable faces, numbered from 1 to $n$. We derive recursive and explicit expressions for the probability mass function and the cumulative distribution…
Understanding the distribution of digits in the expansions of perfect powers in different bases is difficult. Rather than consider the asymptotic digit distributions, we consider the base-10 digits of a restricted sequence of powers of two.…
In a previous work, the first and third authors studied a random knot model for all two-bridge knots using billiard table diagrams. Here we present a closed formula for the distribution of the crossing numbers of such random knots. We also…
In this paper we study the number $M_{m,n}$ of ways to place nonattacking pawns on an $m\times n$ chessboard. We find an upper bound for $M_{m,n}$ and analyse its asymptotic behavior. It turns out that $\lim_{m,n\to\infty}(M_{m,n})^{1/mn}$…
Can a probabilistic gambler get arbitrarily rich when all deterministic gamblers fail? We study this problem in the context of algorithmic randomness, introducing a new notion -- almost everywhere computable randomness. A binary sequence…
We give the proof of a tight lower bound on the probability that a binomial random variable exceeds its expected value. The inequality plays an important role in a variety of contexts, including the analysis of relative deviation bounds in…
This paper is devoted to the structure of the complete asymptotic expansion of the probability that a large combinatorial object is irreducible or consists of a given number of irreducible parts, where irreducibility is understood in terms…
We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…
This article relaxes the integrability condition imposed in the literature for the robust $\alpha$-stable central limit theorem under sublinear expectation. Specifically, for $\alpha \in(0,1]$, we prove that the normalized sums of i.i.d.…
In this contribution we derive an explicit formula for the boundary non-crossing probabilities for Slepian processes associated with the piecewise linear boundary function. This formula is used to develop an approximation formula to the…
Given positive integers $n,k$ with $k\leq n$, we consider the number of ways of choosing $k$ subsets of $\{1,\ldots,n\}$ in such a way that the union of these subsets gives $\{1,\ldots,n\}$ and they are not subsets of each other. We refer…
We investigate the probability that a random odd composite number passes a random Fermat primality test, improving on earlier estimates in moderate ranges. For example, with random numbers to $2^{200}$, our results improve on prior…
Consider an n by n array of cards shuffled in the following manner. An element x of the array is chosen uniformly at random; Then with probability 1/2 the rectangle of cards above and to the left of x is rotated 180 degrees, and with…
We show that any $n$-bit string can be recovered with high probability from $\exp(\widetilde{O}(n^{1/5}))$ independent random subsequences.
We estimate from below the expected Betti numbers of real hypersurfaces taken at random in a smooth real projective n-dimensional manifold. These random hypersurfaces are chosen in the linear system of a large d-th power of a real ample…