All Questions
Tagged with co.combinatorics inequalities
13 questions
62
votes
7
answers
26k
views
Is the Jaccard distance a distance?
Wikipedia defines the Jaccard distance between sets A and B as $$J_\delta(A,B)=1-\frac{|A\cap B|}{|A\cup B|}.$$ There's also a book claiming that this is a metric. However, I couldn't find any ...
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})}\...
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 ...
23
votes
3
answers
3k
views
Cauchy-Schwarz proof of Sidorenko for 3-edge path (Blakley-Roy inequality)
Is there a "Cauchy-Schwarz proof" of the following inequality?
Theorem. Given $f \colon [0,1]^2 \to [0,1]$, one has
$$
\int_{[0,1]^4} f(x,y)f(z,y)f(z,w) \, dxdydzdw \geq \left(\int_{[0,1]^2} f(x,y) \,...
21
votes
1
answer
2k
views
Is there a combinatorial proof of Cauchy-Schwarz?
I've only played with this a little for the past day or so, and haven't thought about it too hard, so it might be obvious. Obviously it's not fair to ask for a "combinatorial proof" of an inequality ...
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<...
9
votes
3
answers
446
views
Pairs of vertices with high degree difference
Consider a finite, simple and undirected graph $G=(V,E)$ with $V=\{v_1,\dots, v_n\}$. Let us also fix an integer $k> n/2$. What are we able to say about the following quantity:
$$\mathcal{I}_k(G) :=...
8
votes
3
answers
456
views
An inequality related to the number of binary strings with no fixed substring
This is basically a repost of this math.se question. At the time I was writing this I thought it has to have a straightforward solution so I posted it there. Now I am not so sure about it being so ...
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,...
4
votes
2
answers
431
views
Combination power elementary symmetric polynomial inequality
Combine my first previous question and second previous question with the Muirhead inequality. I have posed conjectures of two inequalities as follows:
Inequality 1: Let $n>2$ and $1 \le m \le n$...
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 ...
2
votes
3
answers
365
views
Is this number theoretic quantity bounded above?
I am considering a combinatorial argument which involves the following quantity. We use the prime counting function $\pi(n)$ and to save on exponents we set $h=\pi(n/2)$. The quantity as a function ...
0
votes
2
answers
378
views
A symmetric polynomial inequality
I improve my previous question. Because this conjecture is exactly natural development of A Muirhead Like Inequality and Muirhead's Inequality so I think the conjecture is true. But I can not prove it....