Related papers: On the Chvatal-Janson conjecture
The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. From an optimization point of view, one could instead…
The Boltzmann-Wallis-Jaynes' multiplicity argument is taken up and elaborated. MaxEnt is proved and demonstrated to be just an asymptotic case of looking for such a vector of absolute frequencies in a feasible set, which has maximal…
In this article the idea of random variables over the set theoretic universe is investigated. We explore what it can mean for a random set to have a specific probability of belonging to an antecedently given class of sets.
We prove a multivariate version of Bernstein's inequality about the probability that degenerate $U$-statistics take a value larger than some number $u$. This is an improvement of former estimates for the same problem which yields an…
Let $a,b$ and $n$ be positive integers with $a>b$. In this note, we prove that $$(2bn+1)(2bn+3){2bn \choose bn}\bigg|3(a-b)(3a-b){2an \choose an}{an\choose bn}.$$ This confirms a recent conjecture of Amdeberhan and Moll.
The Bateman--Horn Conjecture predicts how often an irreducible polynomial $f(x) \in \mathbb{Z}[x]$ assumes prime values. We demonstrate that with sufficient averaging in the coefficients of $f$ (viz. exponential in the size of the inputs),…
In classical extreme value theory probabilities of extreme events are estimated assuming all the components of a random vector to be in a domain of attraction of an extreme value distribution. In contrast, the conditional extreme value…
We show that a restricted version of a conjecture of M. Talagrand on the relation between "expectation thresholds" and "fractional expectation thresholds" follows easily from a strong version of a second conjecture of Talagrand, on…
We find a nontrivial upper bound on the average value of the function M(n) which associates to every positive integer n the minimal Hamming weight of a multiple of n. Some new results about the equation M(n)=M(n') are given.
In order to give a unified generalization of the BW inequality and the DDVV inequality, Lu and Wenzel proposed three Conjectures 1, 2, 3 and an open Question 1 in 2016. In this paper we discuss further these conjectures and put forward…
Probabilistic proofs of the Johnson-Lindenstrauss lemma imply that random projection can reduce the dimension of a data set and approximately preserve pairwise distances. If a distance being approximately preserved is called a success, and…
We prove the Simons-Johnson theorem for the sums $S_n$ of $m$-dependent random variables, with exponential weights and limiting compound Poisson distribution $\CP(s,\lambda)$. More precisely, we give sufficient conditions for…
We analyze selected iterated conditionals in the framework of conditional random quantities. We point out that it is instructive to examine Lewis's triviality result, which shows the conditions a conditional must satisfy for its probability…
The recent paper [27] provides a statistical analysis for efficient detection of signal components when missing data samples are present. Here we focus our attention to some complex-valued discrete random variables $X_l(m,N)$ ($0\le l\le…
A book $B_n$ is a graph which consists of $n$ triangles sharing a common edge. In 1978, Rousseau and Sheehan conjectured that the Ramsey number satisfies $r(B_m,B_n)\le 2(m+n)+c$ for some constant $c>0$. In this paper, we obtain that…
Bollob\'as and Nikiforov conjectured that for any graph $G \neq K_n$ with $m$ edges \[ \lambda_1^2+\lambda_2^2\le \bigg( 1-\frac{1}{\omega(G)}\bigg)2m\] where $\lambda_1$ and $\lambda_2$ denote the two largest eigenvalues of the adjacency…
Let $S$ and $X$ be independent random variables, assuming values in the set of non-negative integers, and suppose further that both $\mathbb{E}(S)$ and $\mathbb{E}(X)$ are integers satisfying $\mathbb{E}(S)\ge \mathbb{E}(X)$. We establish a…
I gave a geometric proof of Vojta's 1 + epsilon conjecture. Some gaps in the published paper were spotted and kindly pointed out to me by Paul Vojta. These were addressed in "Erratum".
The rank of partitions play an important role in the combinatorial interpretations of several Ramanujan's famous congruence formulas. In 2005 and 2008, the $D$-rank and $M_2$-rank of an overpartition were introduced by Lovejoy,…
The task of the binary classification problem is to determine which of two distributions has generated a length-$n$ test sequence. The two distributions are unknown; two training sequences of length $N$, one from each distribution, are…