313 reputation
17
bio website guyrutenberg.com
location
age
visits member for 1 year, 9 months
seen Apr 26 at 17:16

Apr
6
comment Binomial coefficients inequality
My current approach (which is still untested) goes like this: Show that the inequality holds for $a=0$ and $a=n-s+1$ (which is pretty easy) and then by differentiation show that the left hand side of the inequality achieves its maximum at those end-points (which have the same value). However, as I said I haven't yet written it out and checked that it indeed works.
Apr
5
asked Binomial coefficients inequality
Feb
9
awarded  Tumbleweed
Feb
2
asked Proving that any sufficiently large sequence of vectors has zero-summed subsequence
Oct
13
awarded  Yearling
Aug
7
answered Hamiltonian cycle in tournament
Aug
1
comment Expected Sum of 30 sided die rolls
The expected sum and the most likely result are completely different things. Expected sum, at least for me, seems that should be interpreted as expectation while most likely is the value which maximizes the probability.
Jul
31
answered 2nd largest eigenvalue and rayleigh quotient
Jul
31
awarded  Scholar
Jul
31
accepted 2nd smallest eigenvalues and courant-fisher
Jul
31
answered 2nd smallest eigenvalues and courant-fisher
Jul
29
comment 2nd smallest eigenvalues and courant-fisher
If I add that $\bar 1$ is an eigenvector of $L$ corresponding to $\mu_1$, will that make it easier?
Jul
28
asked 2nd smallest eigenvalues and courant-fisher
Jun
15
awarded  Supporter
Jun
15
answered Prove simple graph with conditions on vertices and edges contains triangle
May
11
awarded  Caucus
May
10
comment Linear Algebra Terminology
@MSEoris: the emphasis here that any subset of $d$ vectors are linearly independent, which isn't the case with an arbitrary set of $n$ vectors, or even a set of $n$ vectors which have a linearly independent set (as opposed to having every subset). The native term (in Hebrew) would be "וקטורים ב-$\mathbb{R}^d$" במצב כללי"
May
10
awarded  Student
May
10
asked Linear Algebra Terminology
May
10
answered Choosing elements from sets