/explore
|
You are here 
|
www.cambridge.org | ||
| | | | |
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$. |
|
| | | | | ||
| | | | |
lucatrevisan.wordpress.com
In which we show how to find the eigenvalues and eigenvectors of Cayley graphs of Abelian groups, we find tight examples for various results that we proved in earlier lectures, and, along the way, we develop the general theory of harmonic analysis which includes the Fourier transform of periodic functions of a real variable, the... |
|
| | | | | ||
| | | | |
terrytao.wordpress.com
Let $latex {G = (G,+)}&fg=000000$ be a finite additive group. A tiling pair is a pair of non-empty subsets $latex {A, B}&fg=000000$ such that every element of $latex {G}&fg=000000$ can |
|
| | | | | ||
| | | | |
www.uraimo.com
Swift provides a convenient set of functionalities for fixed size integers and binary operations but you'll soon discover that in some cases the language is a bit opinionated in regard to how those operations should be performed. This post explains some of the gotchas and describe Bitter, a Swift bit manipulation library. |
|
| | | |||
