All Questions
10 questions
11
votes
2
answers
425
views
Maximization of a cubic form over the $14$-dimensional sphere
For any integers $i$ and $j$ such as $1\le i<j\le6$, let $x_{ij}$ be a nonnegative real number.
Is it true that, given the condition
$$\sum_{1\le i<j\le6}x_{ij}^2=1,$$
the sum
$$\sum_{1\le i<...
5
votes
0
answers
167
views
Bounding elementary symmetric polynomials away from zero
Let $2 \leq m \leq n$ be integers and let $\mathbf{x} \in \mathbb{R}^n$ (importantly, I am not assuming that the entries of $\mathbf{x}$ are non-negative). The elementary symmetric polynomials are ...
9
votes
2
answers
354
views
Asymptotics of a quadratic recursion
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 ...
5
votes
1
answer
258
views
Dimension reduction for non-negativity of elementary symmetric polynomials
Fix integers $1 \leq k \leq n$ and suppose $\mathbf{x} \in \mathbb{R}^n$ is such that $e_j(x_1,x_2,\ldots,x_n) \geq 0$ for all $1 \leq j \leq k$, where $e_j$ is the $j$-th elementary symmetric ...
1
vote
1
answer
474
views
Compare AM and GM
\begin{gather*}
M_g=(x_1\times x_2\times\dotsb\times x_n)^{1/n} \\
M_a=\frac1 n\times (x_1+x_2+\dotsb+x_n).
\end{gather*}
Is it true that $$\lvert M_g-M_a\rvert \leq (\max(x_i) /\min(x_i)) \times(\max(...
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}}(...
0
votes
1
answer
60
views
Bounding the ratio of the $\ell_1$-norms of two real-valued $n$-vectors as a linear combination of their $n$ element-wise ratios
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:
...
1
vote
1
answer
181
views
Optimization problem with definite integral inequality constraints
Question: How can we prove that there exists a real constant $c\ge 1$ such that the following inequality holds for all integers $d>1$ and all real numbers $r\in\left[1,\sqrt{d}\right]$?
$$\int_{-1}^...
1
vote
2
answers
111
views
A two-parameter inequality on product of linear terms
I would like to ask about a certain inequality that I need and which came out of some work in here.
Question. For integers $n\geq1$ and $k\geq3$, is this true? If so, any proof?
$$6\prod_{j=1}^k(...
20
votes
3
answers
1k
views
mixing convex and concave for convexity
Let $n\in\mathbb{N}$ and $0<x<1$ be a real number. Is the following a convex function of $x$?
$$G_n(x)=\log\left(\frac{(1+x^{4n+1})(1+x^{4n-1})(1+x^{2n})(1-x^{2n+1})}{(1+x^{2n+1})(1-x^{2n+2})}\...