/explore
|
You are here 
|
terrytao.wordpress.com | ||
| | | | |
grossack.site
Chris Grossack's math blog and professional website. |
|
| | | | | ||
| | | | |
alanrendall.wordpress.com
In a previous post I discussed the Brouwer fixed point theorem and I mentioned the fact that it applies to any non-empty closed bounded convex subset of a Euclidean space, since a subset of this kind is homeomorphic to a closed ball in a Euclidean space. However I did not prove the latter statement. I... |
|
| | | | | ||
| | | | |
www.jeremykun.com
The First Isomorphism Theorem The meat of our last primer was a proof that quotient groups are well-defined. One important result that helps us compute groups is a very easy consequence of this well-definition. Recall that if $ G,H$ are groups and $ \varphi: G \to H$ is a group homomorphism, then the image of $ \varphi$ is a subgroup of $ H$. Also the kernel of $ \varphi$ is the normal subgroup of $ G$ consisting of the elements which are mapped to the identity under $ \varphi$. |
|
| | | | | ||
| | | | |
algorithmsoup.wordpress.com
In this post, I want to tell you about what I think might be the world's simplest interesting algorithm. The vertex cover problem. Given a graph $latex {G = (V, E)}&fg=000000$, we want to find the smallest set of vertices $latex {S \subseteq V}&fg=000000$ such that every edge $latex {e \in E}&fg=000000$ is covered by... |
|
| | | |||
