Explore >> Select a destination
|
You are here 
|
ncatlab.org | ||
| | | | |
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 | |
| | | | |
qchu.wordpress.com
|
|
| | | | | In this post we'll describe the representation theory of theadditive group scheme$latex \mathbb{G}_a$ over a field $latex k$. The answer turns out to depend dramatically on whether or not $latex k$ has characteristic zero. Preliminaries over an arbitrary ring (All rings and algebras are commutative unless otherwise stated.) The additive group scheme $latex \mathbb{G}_a$ over... | |
| | | | |
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$. | |
| | | | |
theniceweb.com
|
|
| | | |||
