Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Questions about the branch of algebra that deals with groups.
4
votes
Additive Subgroups of the Reals.
Slightly off-topic, a weird subgroup in two dimensions is constructed in this paper:
Ryuji Maehara. On a connected dense proper subgroup of ${\bf R}^2$ whose complement is connected . Proc. Amer. Ma …
5
votes
4
answers
1k
views
Variations to Cayley's Embedding Theorem for Groups
Early in a course in Algebra the result that every group can be embedded as a subgroup
of a symmetric group is introduced. One can further work on it to embed it as a subgroup of a suitable (higher …
-1
votes
Characterization of finite groups generated by one additional element of prime order for eve...
For a prime number $p$ the symmetric group $S_p$ is generated by a $p$-cycle
and a transposition. These two elements generate individually minimal cyclic subgroups. I think this is case d) of Verre …
3
votes
Representation theory of infinite dihedral group
It is a guess. Possibly what is meant is that the polynomial is palindromic: algebraically this means whenever $\alpha$ is a root $\alpha^{-1}$ is also a root, which translates to $f(x) = x^m f(\frac …
1
vote
Parabolic-type subgroups of GL(V)
In Galois theory of algebraic number fields while discussing a prime lying above a prime of the base filed the inertial group is defined as one inducing identity at the residue field level. Your d …
5
votes
General bound for the number of subgroups of a finite group
Can refine Stefan Kohl's suggestion by taking subsets containing the identity element of $G$ and of cardinality dividing $n$.
So the upper bound is $\sum_{d>1, d| n}^n {n-1\choose d-1}$
7
votes
Generating finite simple groups with $2$ elements
There is a paper in arxiv by Robert Guralnick and Gunter Malle
that answers your question in a stronger way.
Their aim is to prove existence of algebraic surfaces
obtained in a specific way as a q …
1
vote
Why do Groups and Abelian Groups feel so different?
Look at Cayley's embedding Theorem which realises every group as a group of permutations. Permutations are functions (from a set to itself . . .).
So an abelian group is a set of commuting permutati …