84 reputation
4
bio website
location
age
visits member for 7 months
seen 16 hours ago
stats profile views 8
@eig

May
18
asked Tools for optimizing asymptotic bounds.
Apr
3
asked The pattern of bitstrings of square numbers
Jan
8
accepted What is the relationship between ZFC and Turing machine?
Jan
3
asked What is the relationship between ZFC and Turing machine?
Dec
17
accepted Insightful proofs for Sherman-Morrison Formula and Matrix Determinant Lemma
Dec
17
comment Insightful proofs for Sherman-Morrison Formula and Matrix Determinant Lemma
Oh, by looking at the spectrum of $I+\mathbf{u}\mathbf{v}^T$, we have the nice proof for Matrix Determinant Lemma as well.
Dec
17
comment Insightful proofs for Sherman-Morrison Formula and Matrix Determinant Lemma
This gives very good explanation. But could you explain more why only $I +\mathbf{u}g\mathbf{v}^T$ satisfies such a spectrum ?
Dec
6
asked Insightful proofs for Sherman-Morrison Formula and Matrix Determinant Lemma
Nov
24
revised Increasing entropy of random walk in regular graph
edited title
Nov
24
awarded  Supporter
Nov
24
revised Increasing entropy of random walk in regular graph
added 4 characters in body
Nov
23
accepted Increasing entropy of random walk in regular graph
Nov
23
revised Increasing entropy of random walk in regular graph
I did not state that G is to be regular.
Nov
23
asked Increasing entropy of random walk in regular graph
Oct
30
awarded  Student
Oct
30
awarded  Scholar
Oct
30
accepted Proving $ \frac{1-(e^{-2})^x}{1-e^{-2}} \ge x $, for $0 \le x \le 1$.
Oct
30
awarded  Editor
Oct
30
revised Proving $ \frac{1-(e^{-2})^x}{1-e^{-2}} \ge x $, for $0 \le x \le 1$.
fixed grammar
Oct
30
asked Proving $ \frac{1-(e^{-2})^x}{1-e^{-2}} \ge x $, for $0 \le x \le 1$.