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.
8
votes
Accepted
lower bound on Aut(G)
Only the trivial bound $2|G|$, because the alternating groups $A_n$, $n\neq 6$ make this sharp. See e.g. the Wikipedia article.
2
votes
Permutation characters and regular orbits
No, it does not. As a simple example, let $G\cong S_3$, $\Omega = G/C_2 \sqcup G/C_2 \sqcup G/C_3$. You can easily check that the corresponding permutation character is isomorphic to the regular chara …
11
votes
When is Inn(X) simple?
Note that $\text{Inn}(X)$ is isomorphic to $X/Z(X)$. So your requirement is equivalent to $X$ being simple modulo the centre. For example $SL_n(\mathbb F_{p^m})$ satisfies this, since the centre is gi …
9
votes
Commutator subgroup of $\Gamma(2).$
I think that the commutator subgroup of $SL(2,\mathbb{Z})$ is an index 2 subgroup of $\Gamma(2)$, rather than $\Gamma(2)$ itself. Indeed, $\Gamma(2)$ has index 6 in $SL(2,\mathbb{Z})$, but you can wri …
4
votes
Proving interesting theorems about S_n using its character table.
In an answer to an earlier question, I showed how to prove that the square root counting function $r_2: S_n\rightarrow \mathbb{N},\;g\mapsto \#\{h\in S_n|h^2=g\}$ assumes its maximum at the identity, …
5
votes
Accepted
Irreducible and faithful $\operatorname{PSL}_2(q)$-module
The answer is "no", since for every sufficiently large prime $p$ there are simple non-trivial $\mathbb{F}_p[{\rm PSL}_2(\mathbb{F}_{2^f})]$-modules. You can take $N$ to be any such module and form the …
6
votes
$p$-groups in which all normal abelian subgroups are cyclic
See Gorenstein, Finite Groups, Chapter 5, Theorem 4.10. Such groups are as follows:
if $p$ is odd, then $G$ is cyclic;
if $p=2$, then $G$ is either cyclic, or generalised quaternion of order $2^l$ f …
7
votes
Accepted
Do isomorphic semi-direct products correspond to conjugate automorphisms?
The answer is no. You can easily have a situation where $f$ is the trivial map, while $g$ makes $H$ act through an inner automorphism of $N$, so that in both cases $N\rtimes H\cong N\times H$. For con …
14
votes
Accepted
Finite order elements of $\mathrm{GL}_d(\mathbb{Z})$ that are conjugate to powers of themselves
The answer is "no" in general. There may be an elementary way of seeing this, but I will frame this in representation theoretic terms and will describe a general construction.
The question is equivale …
2
votes
local-global principles in group cohomology
The local-global principle you are citing comes from the fact that for any open subgroup $H\leq G$, $H^n(G,A)\stackrel{\text{Res}}{\longrightarrow}H^n(H,A)\stackrel{\text{Cor}}{\longrightarrow}H^n(G,A …
7
votes
Accepted
Uncertainty principle on finite groups
Yes, it is. If for any irreducible $\rho$, $\langle\text{Ind}_H^G(1),\rho\rangle$ is either 0 or dim $\rho$, then $H$ is the intersections of $\ker \rho$ for those $\rho$ for which this inner product …
4
votes
Sets M,N with G action such that C[M] = C[N] as G modules, how are they related ?
To answer the question about natural examples/classification, Tim Dokchitser and I have completely classified all such sets in the following sense.
If $\tilde{G}\leq G$, and $M$, $N$ are two $\tilde{ …
5
votes
Heisenberg group over the Gaussian integers
A quick google search produced this paper. It gives generators and relations for the Heisenberg group over rings of integers of quadratic fields and discusses its representations.
5
votes
Is the classification of finite p-groups a smooth problem?
If I understood Joel David Hamkins's explanation correctly, then the problem of classifying finite ($p$-)groups is smooth for silly reasons. Attach to each group the following datum: randomly number t …
5
votes
Using MAGMA for Group Theory
&cat[[h: h in Conjugates(G,H`subgroup) | S subset h]: H in Subgroups(G)];
will create a list of all subgroups of $G$ containing a given group $S$. The main caveat here is that the function Subgroups …