All Questions

I would like to prove the following inequality. It arises from my study of random matrices. I have verified the inequality for $q\in \{0.01,0.02, \ldots, 0.99\}$ and $1\le n\le 100$. Let $n$ be any ...

Consider the sequence defined by \begin{align} c_0 &{}= 1 \\ c_n &{}= 2\,n\,c_{n-1}-\frac{1}{2}\sum_{m=1}^{n-1}c_m\,c_{n-m}. \end{align} How can you prove that it has the following asymptotics ...

We are given an increasing sequence $S$ of positive real numbers $x_1, x_2, \ldots, x_n$, such that $$x_{i+2}-x_{i+1} \ge c\,(x_{i+1}-x_i)$$ for all $i=1, 2, \ldots n-2$, where $c\ge 1$ is constant. ...

On a sequence $(a_k)_{k\geq0}$ of positive integers, define the operator $\mathcal{L}a_k=a_k^2-a_{k-1}a_{k+1}$. Then, $(a_k)_k$ is called log-concave if $\mathcal{L}a_k\geq0$ for all $k\geq0$. One may ...

Let $a_1, a_2, \ldots a_n$ and $b_1, b_2, \ldots b_n$ be two sequences of $n\gg 1$ real numbers such that, for all $1\le i\le n$, we have $0<a_i \le b_i\le 1$. Let the ratio $R$ defined as follows: ...