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.
5
votes
Characterising extendable automorphisms
The papers in the accepted answer by @SixWingedSeraph all refer to a somewhat more specific problem, that of extending an automorphism of a normal subgroup to a larger group. Although the questioner …
12
votes
Product of Frattini Groups
Have you seen the paper The Frattini subgroup of a direct product of groups?
Theorem 1 of that paper gives a necessary and sufficient condition for failure of the equality $\Phi(G \times H) = \Phi(G) …
3
votes
Iterated semi-direct products
Here's a short answer, assuming only that $C$ is an abelian $p$-group and $\vert D \vert$ is relatively prime to $p$.
Remember that $G \cong H\rtimes K$ iff normal subgroup $H$ has a complement in $G …
7
votes
Accepted
Factor subsets of a finite group
You can handle several of the groups on the list from your edit with a modification of the argument of Marty Isaacs. For the rest, you can find guidance as to what a counterexample would look like. …
1
vote
Classification of automorphism groups of groups of order $p^4$
This has the content of a comment, but is somewhat longer and with more formatting than a comment allows, so I post it as an answer.
Anyway: I tried the GAP computation for 2^4, and got results. Fo …
4
votes
Accepted
Using MAGMA for Group Theory
Although you say you'd prefer not to use GAP, producing a Hasse diagram is very easy in GAP, at least with the right packages.
You'll need the xgap GAP package; and either the xgap binaries, which re …
2
votes
Maximal subgroups of odd index in $\mathrm{PSL}(3,q)$
A pretty complete and accessible description of this can be found in a survey article of Oliver King. In addition to the link, here's the citation info:
King, Oliver H., The subgroup structure of fi …
1
vote
Existence (or the number) of generating triple of involutions of $\operatorname{PGL}_2(p)$ w...
You might find helpful the paper of Liebeck and Shalev "Classical Groups, Probabilistic Methods, and the (2,3)-Generation Problem". There, they show that there are three involutions that generate all …
6
votes
Generating finite simple groups with $2$ elements
Carlisle King recently posted an arXiv preprint which (claims to) show that every finite simple group is generated by an involution, together with another element of prime order.
http://arxiv.org/abs/ …
6
votes
Does the hypergraph of subgroups determine a group?
As @Keith Kearnes says, the negative answer ought to be somewhere in Roland Schmidt's book. Unless I'm mistaken, it suffices to find two non isomorphic groups with isomorphic coset lattices. Indeed, …
4
votes
Positivity of the alternating sum of indices for boolean interval of finite groups
UPDATE: The original poster of the question, together with Mamta Balodi, have shown that the labeling I suggest below is an EL-labeling if and only if group (product) complements coincide with lattic …
14
votes
A group-theoretic perspective on Frankl's union closed problem
In a somewhat different direction from Alireza: the conjecture is true for a large family of groups, including all abelian groups and many supersolvable groups.
Let me start with the abelian case. P …
6
votes
Generating random finite groups
Are you running computer experiments to verify conjectures? If so, the GAP SmallGroups library will give you exactly what you want up to $n = 1023$.
For example, the GAP commands
n:=16;; G:=SmallGr …