Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
1 answer
208 views

Proving an exponential sum inequality for symmetric Hamming distance sequences in binary vectors

Background: Let $X = \{0,1\}^k$ represent the set of all binary vectors of length $k$. For two binary vectors $x, y \in X$, the Hamming distance $d_H(x, y)$ is defined as the number of positions where ...
tom jerry's user avatar
  • 359
1 vote
1 answer
207 views

Expectation of the sum of the squares of the cardinal of an inverse function

I sample a random one-to-one function $\pi:\{0\,;\,1\}^n\to\{0\,;\,1\}^n$. I define $f$ as: $$\forall x\in\left[0\,;\,2^n-1\right]\cap\mathbb{N},f(x)=x\oplus\pi(x)$$ where $\oplus$ is the bitwise XOR. ...
Tristan Nemoz's user avatar
12 votes
1 answer
525 views

An inequality about unit vector orthogonal to $(1,1,...,1)$

Does there exist a constant $\alpha>0$ such that the following holds? $$\liminf_{n\to\infty}\inf_{x\in\mathbb{R}^n, \sum_{i=1}^nx_i^2=1, \sum_{i=1}^nx_i=0}\frac{\sum_{i<j, |i-j|\leq\frac{n}{4}}(...
neverevernever's user avatar
2 votes
1 answer
404 views

Euclidean distance bound with geometric constraints

Let $S_n$ be a set of $n$ points belonging to $\mathcal{B}_d:=\{\mathbf{x}\in\mathbb{R}^d:\|\mathbf{x}\|_2\le 1\}$, where $d\ll \log(n)$. Let $s_n$ and $\ell_n$ be respectively defined as follows: $$...
Penelope Benenati's user avatar
0 votes
1 answer
340 views

Expectation of the ratio of two discrete random variables with combinatorial constraints

We are given a set $S=\{1, 2, \ldots, n\}$ where $n\gg 1$, and for all indices $1\le i \le n$, $i$ is associated with a real value $\alpha_i\!\cdot\! v_i$, where $\alpha_i\in[0,1]$ and $v_i\in(0,1]$. ...
Penelope Benenati's user avatar
3 votes
1 answer
229 views

Inequality for difference of consecutive atom probabilities for binomial distribution

Edit: This post was originally two questions, the first of which has been answered, but a reference would still be appreciated if existent. The second question has been removed and migrated to its ...
Pat Devlin's user avatar
  • 2,720
1 vote
2 answers
50 views

Cyclic inequality for 2 dimensional simplex elements

Let $p=(p_{1},p_{2},p_{3})\in\Delta$, with $\Delta:=\lbrace p\in(0,1)^{3}\ |\ p_{1}+p_{2}+p_{3}=1 \rbrace$. I aim to prove (not knowing whether it is true though) that \begin{equation} p_{1}^{p_{3}-p_{...
Tobsn's user avatar
  • 289
2 votes
0 answers
58 views

Bounds for $\sum_{t=1}^Tn_t(s_t)^{-\alpha}\mu(s_t)$ where $n_t(s) = \sum_{1 \le t' \le t} 1_{\{s_{t'}=s\}}$ for $s \in [k]$ and $\mu \in \Delta_k$

Disclaimer: I'm not certain this is the right venue for this post, but I'll give it a try... So trying prove some bounds in my ongoing work in theoretical reinforcement learning, I encountered the ...
dohmatob's user avatar
  • 6,853
-1 votes
1 answer
76 views

Transforming random variables for having good property?

For arbitrary functions $A$ and $B$ and independent random variables $X$ and $Y$, assume that \begin{align} \Omega&\triangleq \{(x,y): A(x,y)=1\},\\ \Lambda&\triangleq \{x: B(x)=1\}. \end{...
Math_Y's user avatar
  • 287
4 votes
2 answers
432 views

How to prove the sum of n squared binomial probabilities does not increase as n increases

Let $F\left( n \right) = \sum\limits_{k = 0}^n {{{\left( {C_n^k{p^k}{{\left( {1 - p} \right)}^{n - k}}} \right)}^2}} $, prove $F\left( n \right) \ge F\left( {n + 1} \right)$. UPDATE: More general, ...
Jack's user avatar
  • 43
1 vote
1 answer
121 views

Probability for high mutual coherence on all subsets of a Gaussian vector set

We examine as set of independent normal vectors: $$ \forall i \in [N]\triangleq \{1,\dots,N\}:\,\mathbf{x}_{i}\sim\mathcal{N}\left(0,\mathbf{I}_{d}\right)$$ For any $\epsilon>0$ and $K\leq N$, we ...
Daniel Soudry's user avatar
4 votes
1 answer
207 views

Upper bound on the number of binary matrices with small rank

I'm looking for the tightest upper bound on the number of different binary matrices $A \in {\{-1,1\}^{m \times n}}$ for which $\mathrm{rank}(A)\leq r$. I'm interested in the regime $1 \ll r \ll m \...
Daniel Soudry's user avatar
13 votes
4 answers
535 views

Alignment of random points

Whenever I draw randomly about ten points, I see that there will be always 3 points that are "almost" collinear. This observation leads me to considering the following questions: Question 1: Suppose $...
Minh-Toan's user avatar
  • 131
5 votes
0 answers
295 views

inequality in a shape of inclusion exclusion formula

I have two inequalities to show, both of which describe some probabilities. First I know how to handle, and it follows from applying arithmetic-harmonic mean inequality: consider 9 numbers $a_1,a_2,...
Marek Adamczyk's user avatar
36 votes
3 answers
4k views

the following inequality is true,but I can't prove it

The inequality is \begin{equation*} \sum_{k=1}^{2d}\left(1-\frac{1}{2d+2-k}\right)\frac{d^k}{k!}>e^d\left(1-\frac{1}{d}\right) \end{equation*} for all integer $d\geq 1$. I use computer to verify ...
useag's user avatar
  • 363
13 votes
3 answers
1k views

A property of unimodal sequences

It is well-known that $(-1)^j \sum_{i=0}^j (-1)^i\binom{n}{i} \geq 0$. This inequality can be used to prove Bonferroni's inequalities for example. Recently I noticed that a similar inequality applies ...
Jose A Rodriguez's user avatar