Sarastro
Reputation
1,588
Next privilege 2,000 Rep.
 Jun 1 reviewed No Action Needed Complement of the radical of a bilinear form Jun 1 reviewed No Action Needed Puzzle: leaning a ladder at $45^\circ$ to a wall using only yourself May 31 reviewed No Action Needed Question regarding the approximant of a function May 31 answered Finding the order of Z(G) in a non-Abelian group of order 8 May 31 reviewed No Action Needed Fibrations over topoi May 30 comment determining a linear isomorphism so that two quadratic forms become equivalent @moran I have edited my answer. May 30 revised determining a linear isomorphism so that two quadratic forms become equivalent added 1429 characters in body May 30 answered determining a linear isomorphism so that two quadratic forms become equivalent May 29 reviewed No Action Needed Reference in EGA May 28 comment Using the Uniform Cauchy Criterion theorem In fact even more is true: not only do the $(f_n)$ converge uniformly, the derivative of the uniform limit is the uniform limit of the $(f_n')$. May 28 reviewed No Action Needed Difference between Pure and Applied Mathematics? May 28 reviewed No Action Needed Gaussian mixture model - mode finding May 28 answered Show that $f(x)=a_0+a_1x+a_2x^2+\cdots+a_nx^n\in R[x]$ is nilpotent iff $a_0,a_1,a_2,\ldots,a_n$ are nilpotent May 25 answered Let $T:U\rightarrow V$ be a linear map and suppose that $rank(T)=dim(U)=dim(V)=n$. Show that the are bases where the matrix is $I_n$ May 24 comment The Image of normal subgroup is also normal subgroup? You need $\phi$ to be surjective. May 24 reviewed Reviewed How to proceed with Euclidean algorithm for finding greatest common divisor of two polynomials. May 21 reviewed No Action Needed Counting Spanning Trees Needed to cover Edges May 21 reviewed No Action Needed Number of different possible armies in Clash of Clans May 20 comment Class of graphs with symmetric random walk That's a reversible Markov chain, and it holds if the initial distribution is the invariant distribution. The kind of random walk you describe is always reversible for a finite connected graph. May 20 reviewed Reviewed Prove $F(n) < 2^n$