Skip to main content

All Questions

Filter by
Sorted by
Tagged with
0 votes
2 answers
116 views

Upper bounds on quotients of binomial coefficients

Let $\gamma>1$ be a real number and let $n\in \mathbb{N}$. Define $f\colon\mathbb{N}\to[0,1]$ $$ f(n_0) = \frac{\binom{n-n_0}{m}}{\binom{n}{m}}, $$ where $$ m = \Big\lfloor{\frac{n}{\lceil\gamma ...
xabialgebra's user avatar
1 vote
1 answer
318 views

How to calculate this limit (if exist)?

I have just asked the calculation of the following summation see here $$S(a,b,m,n_1,n_2)=\sum_{k=0}^m a^k b^{m-k} {n_1\choose k} {n_2\choose m-k}, $$ which is motivated by the calculation of the ...
Dian's user avatar
  • 57
2 votes
1 answer
383 views

Lower bound and limit of a sum with binomial coefficients

Let $$A_k = \sum_{i=1}^k i {3k-2i-1 \choose i-1} {2i-2 \choose k-i}$$ $$B_k = \sum_{i=1}^k i {3k-2i-2 \choose i-1} {2i-1 \choose k-i}$$ $$C_k = \sum_{i=1}^k (3k-2i-2) {3k-2i-3 \choose i-1} {2i\...
macat's user avatar
  • 155
5 votes
4 answers
917 views

Limit of a sum with binomial coefficients

Let $$A_k = \frac{\sum_{i=1}^ki{2k-i-1 \choose i-1}{i-1 \choose k-i}}{k{2k-1\choose k}}$$ $$B_k = \frac{\sum_{i=1}^ki{2k-i-2 \choose i-1}{i \choose k-i}}{k{2k-1\choose k}}$$ $$C_k = \frac{\sum_{i=1}^k(...
macat's user avatar
  • 155
4 votes
1 answer
322 views

Approximating binomial coefficient sum

I have the following exact sum for the expectation of an event $$\sum_{m=0}^{nk} \sum_{j=1}^n (-1)^{j-1}\binom{n}{j} \binom{(n-j)k}{m} / \binom{nk}{m}$$ which is exactly correct but I want to give an ...
Doc Stories's user avatar
9 votes
1 answer
1k views

Bounding the probability that two binomials are equal

Note: This question was migrated from this earlier post, where it initially appeared. Following suggestions, I moved this into its own question. Let $B_{n,p}$ denote the usual binomial random ...
Pat Devlin's user avatar
  • 2,720
0 votes
1 answer
208 views

Local behavior of the Vandermonde convolution

An interesting combinatorial identity is the Vandermonde convolution identity: $$ \sum_k {n\choose k}{m\choose s-k} = {n+m \choose s},$$ which can be proved by considering the coefficients in $(x+1)^{...
Student's user avatar
  • 5,230
4 votes
1 answer
272 views

How far do I have to go for the tail of a binomial distribution with small $p$ to be $O(1/n)$?

Let $n$ be a large integer, $p$ be a small number (say, $p=C/n$ for some constant $C \ll n$), and consider the tail of the binomial distribution $B(n,p)$, after $T$: $$ \delta = \sum_{s=T}^{n} p^s (1-...
Ted's user avatar
  • 267
1 vote
1 answer
363 views

limit and combinatorics

Given $x \in (0,\frac{1}{2})$ and $y \in (0,\frac{1}{2}]$, what is the value of the following limit: $\lim_{n\rightarrow \infty}\sum_{k=0}^{n}{n \choose k}|x^{n-k}(1-x)^{k}-y^{n-k}(1-y)^{k}|?$ When $...
Bruno Brogni Uggioni's user avatar
1 vote
0 answers
255 views

An extrasensory perception strategy :-)

I asked this question at MSE some months ago but I received only partial answers, so I put it here. The following sounds nice for me and I spent a good time during the investigation. But I am a ...
Alex Ravsky's user avatar
  • 5,409
18 votes
1 answer
2k views

How big is the sum of smallest multinomial coefficients?

Given positive integers $n$ and $d$, let $S$ indicate the list of all $d$-tuples of non-negative integers $(c_1,\ldots,c_d)$ such that $c_1+\cdots+c_d=n$. Let $v_i$ be the value of the multinomial ...
Yaroslav Bulatov's user avatar