Finding $m,n,k$ for which $|G|=mn$ and $G$ is nonabelian, where $G$ is given by $langle x,ymid...
Multi tool use
$begingroup$
$G$ is defined by the relations $x^m=y^n=1,xy=yx^k$. For which $m,n,k$ does this give a nonabelian group order $mn$?
I started playing around with this using GAP, starting with the case where $m=13$.
For $n=3$ only $k=3,9$ worked, and they generated isomorphic groups, similarly for $n=9$. For $n=5,7,11$ no value of $k$ worked. For $n=2$, $k=12$ worked. For $n=4$, $k=5,8$ worked and generated isomorphic groups. $k=12$ also worked but generated a non-isomorphic group. Similarly for $n=8$. For $n=6$, $k=3,4,9,10,12$ worked. The groups for $k=3,9$ were isomorphic. and those for $k=4,10$ were isomorphic.
For $n=12$, $k=2,dots,12$ all worked. Those for $k=2,6,7,11$ were isomorphic, those for $k=3,9$ were isomorphic, those for $k=4,10$ were isomorphic, and those for $k=5,8$ were isomorphic.
I am having difficulty figuring out what is going on. Is all this well-known material? Is there a complete or partial answer to the opening question (for which $m,n,k$ do we get a non-abelian group order $mn$)? If so, where can I find it?
Also how does one do this stuff by hand? I tried a few cases and found it quite tricky to prove that $x=1$, as often happened for the $k$ that failed.
gap group-presentation finitely-generated
$endgroup$
|
show 4 more comments
$begingroup$
$G$ is defined by the relations $x^m=y^n=1,xy=yx^k$. For which $m,n,k$ does this give a nonabelian group order $mn$?
I started playing around with this using GAP, starting with the case where $m=13$.
For $n=3$ only $k=3,9$ worked, and they generated isomorphic groups, similarly for $n=9$. For $n=5,7,11$ no value of $k$ worked. For $n=2$, $k=12$ worked. For $n=4$, $k=5,8$ worked and generated isomorphic groups. $k=12$ also worked but generated a non-isomorphic group. Similarly for $n=8$. For $n=6$, $k=3,4,9,10,12$ worked. The groups for $k=3,9$ were isomorphic. and those for $k=4,10$ were isomorphic.
For $n=12$, $k=2,dots,12$ all worked. Those for $k=2,6,7,11$ were isomorphic, those for $k=3,9$ were isomorphic, those for $k=4,10$ were isomorphic, and those for $k=5,8$ were isomorphic.
I am having difficulty figuring out what is going on. Is all this well-known material? Is there a complete or partial answer to the opening question (for which $m,n,k$ do we get a non-abelian group order $mn$)? If so, where can I find it?
Also how does one do this stuff by hand? I tried a few cases and found it quite tricky to prove that $x=1$, as often happened for the $k$ that failed.
gap group-presentation finitely-generated
$endgroup$
$begingroup$
Note that if $n=2$ and $k=m-1$, you get a dihedral group. Not very complete, I know :)
$endgroup$
– Patrick Stevens
Feb 21 '18 at 19:25
$begingroup$
Why not have a look at $y^{-n}xy^n$?
$endgroup$
– ancientmathematician
Feb 21 '18 at 20:58
1
$begingroup$
The first thing to note is that the relation can be rewritten as $y^{-1}xy = x^k$. So the requirement is that conjugation by $y$ should give an automorphism of $langle xrangle$ of order dividing $k$. Since the automorphism group of $langle xrangle$ has order $varphi(m)$, this immediately gives some restrictions. On the other hand, once these restrictions are satisfied, one can construct the desired group as a semidirect product.
$endgroup$
– Tobias Kildetoft
Feb 22 '18 at 7:01
1
$begingroup$
@ancientmathematician Yes, that is an excellent point. So the condition is $k^n=1bmod m$. Many thanks.
$endgroup$
– almagest
Feb 23 '18 at 10:53
1
$begingroup$
I suppose to be complete one also needs to see that with this necessary condition one can actually find a non-abelian group meeting this spec. I usually look in the group of all $tmapsto at+b$, $binmathbb{Z}_m$, $ainmathbb{Z}^{*}_m$ for the appropriate subgroup.
$endgroup$
– ancientmathematician
Feb 23 '18 at 11:50
|
show 4 more comments
$begingroup$
$G$ is defined by the relations $x^m=y^n=1,xy=yx^k$. For which $m,n,k$ does this give a nonabelian group order $mn$?
I started playing around with this using GAP, starting with the case where $m=13$.
For $n=3$ only $k=3,9$ worked, and they generated isomorphic groups, similarly for $n=9$. For $n=5,7,11$ no value of $k$ worked. For $n=2$, $k=12$ worked. For $n=4$, $k=5,8$ worked and generated isomorphic groups. $k=12$ also worked but generated a non-isomorphic group. Similarly for $n=8$. For $n=6$, $k=3,4,9,10,12$ worked. The groups for $k=3,9$ were isomorphic. and those for $k=4,10$ were isomorphic.
For $n=12$, $k=2,dots,12$ all worked. Those for $k=2,6,7,11$ were isomorphic, those for $k=3,9$ were isomorphic, those for $k=4,10$ were isomorphic, and those for $k=5,8$ were isomorphic.
I am having difficulty figuring out what is going on. Is all this well-known material? Is there a complete or partial answer to the opening question (for which $m,n,k$ do we get a non-abelian group order $mn$)? If so, where can I find it?
Also how does one do this stuff by hand? I tried a few cases and found it quite tricky to prove that $x=1$, as often happened for the $k$ that failed.
gap group-presentation finitely-generated
$endgroup$
$G$ is defined by the relations $x^m=y^n=1,xy=yx^k$. For which $m,n,k$ does this give a nonabelian group order $mn$?
I started playing around with this using GAP, starting with the case where $m=13$.
For $n=3$ only $k=3,9$ worked, and they generated isomorphic groups, similarly for $n=9$. For $n=5,7,11$ no value of $k$ worked. For $n=2$, $k=12$ worked. For $n=4$, $k=5,8$ worked and generated isomorphic groups. $k=12$ also worked but generated a non-isomorphic group. Similarly for $n=8$. For $n=6$, $k=3,4,9,10,12$ worked. The groups for $k=3,9$ were isomorphic. and those for $k=4,10$ were isomorphic.
For $n=12$, $k=2,dots,12$ all worked. Those for $k=2,6,7,11$ were isomorphic, those for $k=3,9$ were isomorphic, those for $k=4,10$ were isomorphic, and those for $k=5,8$ were isomorphic.
I am having difficulty figuring out what is going on. Is all this well-known material? Is there a complete or partial answer to the opening question (for which $m,n,k$ do we get a non-abelian group order $mn$)? If so, where can I find it?
Also how does one do this stuff by hand? I tried a few cases and found it quite tricky to prove that $x=1$, as often happened for the $k$ that failed.
gap group-presentation finitely-generated
gap group-presentation finitely-generated
edited Dec 14 '18 at 3:44
Shaun
9,083113683
9,083113683
asked Feb 21 '18 at 19:22
almagestalmagest
12.1k1329
12.1k1329
$begingroup$
Note that if $n=2$ and $k=m-1$, you get a dihedral group. Not very complete, I know :)
$endgroup$
– Patrick Stevens
Feb 21 '18 at 19:25
$begingroup$
Why not have a look at $y^{-n}xy^n$?
$endgroup$
– ancientmathematician
Feb 21 '18 at 20:58
1
$begingroup$
The first thing to note is that the relation can be rewritten as $y^{-1}xy = x^k$. So the requirement is that conjugation by $y$ should give an automorphism of $langle xrangle$ of order dividing $k$. Since the automorphism group of $langle xrangle$ has order $varphi(m)$, this immediately gives some restrictions. On the other hand, once these restrictions are satisfied, one can construct the desired group as a semidirect product.
$endgroup$
– Tobias Kildetoft
Feb 22 '18 at 7:01
1
$begingroup$
@ancientmathematician Yes, that is an excellent point. So the condition is $k^n=1bmod m$. Many thanks.
$endgroup$
– almagest
Feb 23 '18 at 10:53
1
$begingroup$
I suppose to be complete one also needs to see that with this necessary condition one can actually find a non-abelian group meeting this spec. I usually look in the group of all $tmapsto at+b$, $binmathbb{Z}_m$, $ainmathbb{Z}^{*}_m$ for the appropriate subgroup.
$endgroup$
– ancientmathematician
Feb 23 '18 at 11:50
|
show 4 more comments
$begingroup$
Note that if $n=2$ and $k=m-1$, you get a dihedral group. Not very complete, I know :)
$endgroup$
– Patrick Stevens
Feb 21 '18 at 19:25
$begingroup$
Why not have a look at $y^{-n}xy^n$?
$endgroup$
– ancientmathematician
Feb 21 '18 at 20:58
1
$begingroup$
The first thing to note is that the relation can be rewritten as $y^{-1}xy = x^k$. So the requirement is that conjugation by $y$ should give an automorphism of $langle xrangle$ of order dividing $k$. Since the automorphism group of $langle xrangle$ has order $varphi(m)$, this immediately gives some restrictions. On the other hand, once these restrictions are satisfied, one can construct the desired group as a semidirect product.
$endgroup$
– Tobias Kildetoft
Feb 22 '18 at 7:01
1
$begingroup$
@ancientmathematician Yes, that is an excellent point. So the condition is $k^n=1bmod m$. Many thanks.
$endgroup$
– almagest
Feb 23 '18 at 10:53
1
$begingroup$
I suppose to be complete one also needs to see that with this necessary condition one can actually find a non-abelian group meeting this spec. I usually look in the group of all $tmapsto at+b$, $binmathbb{Z}_m$, $ainmathbb{Z}^{*}_m$ for the appropriate subgroup.
$endgroup$
– ancientmathematician
Feb 23 '18 at 11:50
$begingroup$
Note that if $n=2$ and $k=m-1$, you get a dihedral group. Not very complete, I know :)
$endgroup$
– Patrick Stevens
Feb 21 '18 at 19:25
$begingroup$
Note that if $n=2$ and $k=m-1$, you get a dihedral group. Not very complete, I know :)
$endgroup$
– Patrick Stevens
Feb 21 '18 at 19:25
$begingroup$
Why not have a look at $y^{-n}xy^n$?
$endgroup$
– ancientmathematician
Feb 21 '18 at 20:58
$begingroup$
Why not have a look at $y^{-n}xy^n$?
$endgroup$
– ancientmathematician
Feb 21 '18 at 20:58
1
1
$begingroup$
The first thing to note is that the relation can be rewritten as $y^{-1}xy = x^k$. So the requirement is that conjugation by $y$ should give an automorphism of $langle xrangle$ of order dividing $k$. Since the automorphism group of $langle xrangle$ has order $varphi(m)$, this immediately gives some restrictions. On the other hand, once these restrictions are satisfied, one can construct the desired group as a semidirect product.
$endgroup$
– Tobias Kildetoft
Feb 22 '18 at 7:01
$begingroup$
The first thing to note is that the relation can be rewritten as $y^{-1}xy = x^k$. So the requirement is that conjugation by $y$ should give an automorphism of $langle xrangle$ of order dividing $k$. Since the automorphism group of $langle xrangle$ has order $varphi(m)$, this immediately gives some restrictions. On the other hand, once these restrictions are satisfied, one can construct the desired group as a semidirect product.
$endgroup$
– Tobias Kildetoft
Feb 22 '18 at 7:01
1
1
$begingroup$
@ancientmathematician Yes, that is an excellent point. So the condition is $k^n=1bmod m$. Many thanks.
$endgroup$
– almagest
Feb 23 '18 at 10:53
$begingroup$
@ancientmathematician Yes, that is an excellent point. So the condition is $k^n=1bmod m$. Many thanks.
$endgroup$
– almagest
Feb 23 '18 at 10:53
1
1
$begingroup$
I suppose to be complete one also needs to see that with this necessary condition one can actually find a non-abelian group meeting this spec. I usually look in the group of all $tmapsto at+b$, $binmathbb{Z}_m$, $ainmathbb{Z}^{*}_m$ for the appropriate subgroup.
$endgroup$
– ancientmathematician
Feb 23 '18 at 11:50
$begingroup$
I suppose to be complete one also needs to see that with this necessary condition one can actually find a non-abelian group meeting this spec. I usually look in the group of all $tmapsto at+b$, $binmathbb{Z}_m$, $ainmathbb{Z}^{*}_m$ for the appropriate subgroup.
$endgroup$
– ancientmathematician
Feb 23 '18 at 11:50
|
show 4 more comments
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2660734%2ffinding-m-n-k-for-which-g-mn-and-g-is-nonabelian-where-g-is-given-by%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2660734%2ffinding-m-n-k-for-which-g-mn-and-g-is-nonabelian-where-g-is-given-by%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
kSMfw1nAft7PQoziSq1KHJwwCS1VPP7wnFmZyTdUIlm g 8ivkyo4rHv3TnpILq,o45UdV G2wq,YuDKlGIr l
$begingroup$
Note that if $n=2$ and $k=m-1$, you get a dihedral group. Not very complete, I know :)
$endgroup$
– Patrick Stevens
Feb 21 '18 at 19:25
$begingroup$
Why not have a look at $y^{-n}xy^n$?
$endgroup$
– ancientmathematician
Feb 21 '18 at 20:58
1
$begingroup$
The first thing to note is that the relation can be rewritten as $y^{-1}xy = x^k$. So the requirement is that conjugation by $y$ should give an automorphism of $langle xrangle$ of order dividing $k$. Since the automorphism group of $langle xrangle$ has order $varphi(m)$, this immediately gives some restrictions. On the other hand, once these restrictions are satisfied, one can construct the desired group as a semidirect product.
$endgroup$
– Tobias Kildetoft
Feb 22 '18 at 7:01
1
$begingroup$
@ancientmathematician Yes, that is an excellent point. So the condition is $k^n=1bmod m$. Many thanks.
$endgroup$
– almagest
Feb 23 '18 at 10:53
1
$begingroup$
I suppose to be complete one also needs to see that with this necessary condition one can actually find a non-abelian group meeting this spec. I usually look in the group of all $tmapsto at+b$, $binmathbb{Z}_m$, $ainmathbb{Z}^{*}_m$ for the appropriate subgroup.
$endgroup$
– ancientmathematician
Feb 23 '18 at 11:50