333 reputation
17
bio website guyrutenberg.com
location
age
visits member for 2 years
seen Oct 9 at 7:33

Sep
19
comment The number of lattice points in d-dimensional ball
You're probably right. I'm only interested in cases where $d$ is large enough.
Sep
16
asked The number of lattice points in d-dimensional ball
Sep
16
accepted Binomial coefficients inequality
Aug
30
answered Binomial coefficients inequality
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