Skip to main content

All Questions

Filter by
Sorted by
Tagged with
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 ...
rgrig's user avatar
  • 1,355
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
28 votes
3 answers
1k views

Inequality for hook numbers in Young diagrams

Consider a Young diagram $\lambda = (\lambda_1,\ldots,\lambda_\ell)$. For a square $(i,j) \in \lambda$, define hook numbers $h_{ij} = \lambda_i + \lambda_j' -i - j +1$ and complementary hook numbers $...
Igor Pak's user avatar
  • 17k
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) \,...
Yufei Zhao's user avatar
23 votes
1 answer
1k views

Symmetric polynomial inequality arising from the fixed-point measure of a random permutation

A somewhat strange elementary polynomial inequality came up recently in my work, and I wonder if anyone has seen other things that are reminiscent of what follows. Given $n$ non-negative reals $a_1, ...
BPN's user avatar
  • 543
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 ...
Harrison Brown's user avatar
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})}\...
T. Amdeberhan's user avatar
18 votes
4 answers
1k views

Proving univariate polynomials (defined by sums, binomial coeffs, etc.) are nonnegative: is it 'routine'?

My colleagues and I are working on a project related to an old paper of C. Borell and we have boiled it down to the following problem: Show, for all integers $1 \leq i \leq k$, that the univariate ...
Ryan O'Donnell's user avatar
15 votes
2 answers
788 views

Combinatorial inequality involving alternating signs

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 ...
shortfatboy's user avatar
14 votes
2 answers
963 views

Conjecture on maximum of symmetric combinatoric function

A curious symmetric function crossed my way in some quantum mechanics calculations, and I'm interested its maximum value (for which I do have a conjecture). (The question was first asked at math.SE, ...
Mario Krenn'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
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
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
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<...
Iosif Pinelis's user avatar
11 votes
0 answers
387 views

Inequality for symmetric polynomial functions of log concave variables

Let $(x_i)_{i \ge 1}$ be a log-concave (resp. log-convex) sequence of non-negative real variables. In other words, for $i \ge 2$, we have $x_i^2 \ge x_{i-1}x_{i+1}$ (resp. $x_i^2 \le x_{i-1}x_{i+1}$). ...
René Gy's user avatar
  • 505
11 votes
0 answers
291 views

$L_2$ minimizing makespan vs. $L_\infty$ minimizing makespan

There are $n$ positive real numbers. We partition these numbers into $m$ parts, the size of each part is the sum the numbers in this part. Maximum size of the parts is called a makespan of a partition....
kakia's user avatar
  • 399
10 votes
2 answers
496 views

Inequalities for averaging over partially ordered sets

Let's start from a classical inequality: If $0\le a_1\le\cdots\le a_k$ and $0\le b_1\le\cdots\le b_k$ then $(a_1+\cdots+a_k)(b_1+\cdots+b_k)\le k(a_1b_1+\cdots+a_k b_k)$. It can be written also in ...
Dmitry Kerner's user avatar
10 votes
1 answer
2k views

Sum of difference moduli vs. sum of modulus differences

This is a failed attempt of mine at creating a contest problem; the failure is in the fact that I wasn't able to solve it myself. Let $x_1$, $x_2$, ..., $x_n$ be $n$ reals. For any integer $k$, ...
darij grinberg's user avatar
10 votes
1 answer
205 views

Disjoint sets with twice ratio

Given are a positive integer $n$ and positive real numbers $a_1,\dots,a_n,b_1,\dots,b_n$. A subset $S\subseteq N=\{1,\dots,n\}$ is called $a$-good if $$\sum_{i\in S}a_i\geq \frac{1}{2}\left(\sum_{i\in ...
pi66's user avatar
  • 1,209
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 ...
Matteo Beccaria's user avatar
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) :=...
user avatar
9 votes
1 answer
406 views

Maximize sum of products of binary variable

Let $n>k$ be positive integers, $r>1$ a positive real number, and $A=\{1,2,\dots,n\}$. For $1\leq i\neq j\leq n$, let $a_{i,j}\in\{r,1\}$ be such that $a_{i,j}=r\Leftrightarrow a_{j,i}=1$. ...
pi66's user avatar
  • 1,209
9 votes
0 answers
365 views

How to count integer lattice points close to a subspace of $\mathbb R^n$?

Consider $m$ linearly independent vectors in $n$-dimensional Euclidean space, $v_1,...,v_m \in \mathbb R^n$ where $1\leq m<n$, and let $U := {\rm span}(v_1,...,v_m)$ denote the $m$-dimensional ...
Dierk Bormann's user avatar
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 ...
Jernej's user avatar
  • 3,463
8 votes
1 answer
412 views

Big triples in a matrix

Consider an $n\times n$ real matrix $A=(a_{ij})$ with non negative entries. Assume that - the sum of the three largest entries in each row is a constant $R$ (the same for all rows), - the sum of the ...
Yaakov Baruch's user avatar
8 votes
1 answer
531 views

How large can the dimension of a 'Span of powers of a finite field basis' be?

Let $p$ be a prime. For finite field $\mathbb{F}_{p^k}$ and $d\in\mathbb{Z}^+$, I am considering the following quantity, where we interpret the field $\mathbb{F}_{p^k}$ also as a $\mathbb{F}_p$-vector ...
actcon's user avatar
  • 89
6 votes
4 answers
2k views

Sum over integer compositions

Sorry if the question is trivial - are there closed form expressions or good approximations for the sum of a symmetric function taken over all integer compositions (into given number of parts) of a ...
László Kozma's user avatar
6 votes
1 answer
371 views

An inequality for rearrangement-style sums

The following is a holdover from my math contest days that I never got around to solve. We will use the notation $\left[ k\right] $ for the set $\left\{ 1,2,\ldots,k\right\} $ whenever $k$ is a ...
darij grinberg's user avatar
6 votes
1 answer
372 views

Maximizing a sum minus its maximal summand

This is a followup to a question that appeared on m.SE: Maximize $\displaystyle f(\pi)=\left(\sum_{i=1}^{n}{i\pi_i}\right)-\max_{1\le i\le n}{(i\pi_i)}$ over permutations $\pi\in S_n$. The problem ...
Alexander Burstein's user avatar
6 votes
0 answers
171 views

An inequality involving integer partitions

For integers $n\ge k\ge0$, let $p(n,k)$ denote the number of ways to write $n$ as a sum of $k$ positive integers (repetition allowed). For example, $p(6,3)=3$ since $$6=1+1+4=1+2+3=2+2+2.$$ QUESTION. ...
Zhi-Wei Sun's user avatar
  • 15.6k
6 votes
0 answers
381 views

An inequality related to the numbers of faces of polytopes with d+2 facets

I would like to prove an inequality related to the number of $k$-faces of two $d$-polytopes with $d+2$ facets; see (1) below. Let $r>0$, $s>0$, $t\ge 0$, and $d\ge 2$ be such that $d=r+s+t$. We ...
Guillermo Pineda-Villavicencio's user avatar
6 votes
0 answers
132 views

Q-analogue of an inequality

Pick integers $b\geq a \geq 0$ and $k\geq j\geq 0$. It is not super-difficult to prove the inequality $$ \binom{kb}{ka}^j \geq \binom{jb}{ja}^k. $$ This is actually quite a nice inequality that was ...
Per Alexandersson's user avatar
6 votes
0 answers
630 views

Counting permutation matrices in 0,1,2 matrices

Let $M$ be a matrix with entries equal to 0, 1 or 2, such that all of the row and column sums are equal to $c$. The Van der Waerden bound gives (roughly) the following bound on the permanent of $M$: ...
Zur Luria's user avatar
  • 1,643
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 ...
Nathaniel Johnston's user avatar
5 votes
0 answers
183 views

On the polynomials $\sum_{k=0}^n\binom{n+k}k^m q^k$

A sequence of polynomials $$P_0(q),\ P_1(q),\ P_2(q),\ \ldots$$ with real coefficients is called $q$-log-convex if for each $n=1,2,3,\ldots$ every coefficient of the polynomial $P_{n+1}(q)P_{n-1}(q)-...
Zhi-Wei Sun's user avatar
  • 15.6k
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 ...
Nathaniel Johnston's user avatar
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
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
4 votes
1 answer
427 views

Inequality of inclusion-exclusion term

This question was initially posted on math.stackexchange.com but did not receive any answers for half a week. While analyzing the properties of an algorithm I am working on (I'm a computer scientist), ...
Tobias's user avatar
  • 45
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$...
Đào Thanh Oai's user avatar
4 votes
2 answers
304 views

High degree differences in bipartite graphs

Consider a finite, simple and undirected graph $G=(V,E)$ with $V=\{v_1,\dots, v_n\}$. Let us define the quantity: $$\mathcal{I}_k(G) := \sum_{1\le i,j \le n} \mathbb{1}{\Big\{|\mathrm{deg}(v_i)-\...
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
4 votes
3 answers
2k views

Factorial-inequalities

Let $n>15$ be an integer. Suppose also $n=\sum_{i=1}^n ic_i$, where $c_i$ are non-negative integers. Assume further that $c_1<4$. Is the following inequality true? $$\frac{n!}{\prod_{i=1}^{n}i^{...
Alireza Abdollahi's user avatar
4 votes
1 answer
100 views

Combined identity perturbation

I found the interesting inequality when I study hypergraph 2-coloring $$\sum_{i+j=k} \binom{r-1}{i}\binom{r-1}{j}(1-p)^i(1+p)^j \leq \binom{2r-2}{k}$$ $0\leq i, j < r$, $0\leq p \leq 1$. I want to ...
phantom's user avatar
  • 317
4 votes
1 answer
111 views

Upper bound for an expression for distributive lattices

Let $L$ be a finite distributive lattice with minimum $0$ and Maximum $1$ and join-irreducible elements $j_1,...,j_l$ and meet irreducible elements $m_1,...,m_l$. Let $J_L:= \sum\limits_{i=1}^{l}{| [...
Mare's user avatar
  • 26.5k
4 votes
1 answer
1k views

upper bound on derivatives of a function defined on an arc

This is a simple question I asked in math.SE last month but unfortunately no one gives any comment. So I decided to try some luck here. You can skip examples below and read from "General setting" at ...
booksee's user avatar
  • 398
3 votes
2 answers
459 views

Short sequence beats long sequence

I have encountered some comparison between two binomial sums. It was amusing how the one with "fewer" summands exceeds (in value) than the other which consists of many more terms. In fact, ...
T. Amdeberhan's user avatar
3 votes
1 answer
272 views

An inequality about factorial function

Let $d,s,k$ be integers such that $d<s+2$, $s=o(k)$. For sufficiently large integer $k$, is the following inequality right? $$\frac{(k-2d+1)^{k+s-d}}{(k-d)!\cdot (k-2)_s} \ge 1$$ We write $(k)_s = ...
Yuhang Bai's user avatar
3 votes
2 answers
255 views

Inequality for Gaussian polynomials III

Recall the constructions $[n]_q=\frac{1-q^n}{1-q}, [n]!_q=[1]_q[2]_q\cdots[n]_q$ with $[0]!_q:=1$ and the $q$-binomials (Gaussian polynomials) $$\binom{n}k_q=\frac{[n]!_q}{[k]!_q[n-k]!_q}.$$ Given two ...
T. Amdeberhan's user avatar
3 votes
1 answer
143 views

Combinatorial Euclidean geometry problem

Let $\mathcal{S}^d_{\epsilon}$ be the collection of all sets $S:=\{\mathbf{x}_1, \mathbf{x}_2, \ldots \mathbf{x}_{d+1}\}$ of $d+1$ points in a $d$-dimensional Euclidean space such that, for a given ...
Penelope Benenati's user avatar