Is there a general way to simplify such group presentations (Free Abelian Group with Relations)?
$begingroup$
If I want to simplify the group presentation (free abelian group with relations)
$$langle a,b,cmid 2a=b=2crangle,$$
I can simplify it as $$langle a,cmid 2a=2crangleconglangle a,a-cmid 2(a-c)ranglecongmathbb{Z}oplusmathbb{Z}_2.$$
How about for more complicated presentations such as
$$langle a,b,cmid 2a=3b=5crangle?$$
How do I simplify it, if possible?
In general, I am interested in simplifying
$$langle a,b,cmid n_1a=n_2b=n_3crangle,$$
where $n_1,n_2,n_3inmathbb{Z}$.
Thanks.
abstract-algebra group-theory group-presentation combinatorial-group-theory
edited Dec 3 '18 at 0:43
Shaun
8,893113681
asked Feb 5 '18 at 7:41
yoyosteinyoyostein
7,91593768
$endgroup$
add a comment |
$begingroup$
If I want to simplify the group presentation (free abelian group with relations)
$$langle a,b,cmid 2a=b=2crangle,$$
I can simplify it as $$langle a,cmid 2a=2crangleconglangle a,a-cmid 2(a-c)ranglecongmathbb{Z}oplusmathbb{Z}_2.$$
How about for more complicated presentations such as
$$langle a,b,cmid 2a=3b=5crangle?$$
How do I simplify it, if possible?
In general, I am interested in simplifying
$$langle a,b,cmid n_1a=n_2b=n_3crangle,$$
where $n_1,n_2,n_3inmathbb{Z}$.
Thanks.
abstract-algebra group-theory group-presentation combinatorial-group-theory
edited Dec 3 '18 at 0:43
Shaun
8,893113681
asked Feb 5 '18 at 7:41
yoyosteinyoyostein
7,91593768
$endgroup$
2
$begingroup$
The general method for this problem is the Smith Normal Form diagonlization algorithm for matrices over the integers.
$endgroup$
– Derek Holt
Feb 5 '18 at 9:46
add a comment |
$begingroup$
If I want to simplify the group presentation (free abelian group with relations)
$$langle a,b,cmid 2a=b=2crangle,$$
I can simplify it as $$langle a,cmid 2a=2crangleconglangle a,a-cmid 2(a-c)ranglecongmathbb{Z}oplusmathbb{Z}_2.$$
How about for more complicated presentations such as
$$langle a,b,cmid 2a=3b=5crangle?$$
How do I simplify it, if possible?
In general, I am interested in simplifying
$$langle a,b,cmid n_1a=n_2b=n_3crangle,$$
where $n_1,n_2,n_3inmathbb{Z}$.
Thanks.
abstract-algebra group-theory group-presentation combinatorial-group-theory
edited Dec 3 '18 at 0:43
Shaun
8,893113681
asked Feb 5 '18 at 7:41
yoyosteinyoyostein
7,91593768
$endgroup$
If I want to simplify the group presentation (free abelian group with relations)
$$langle a,b,cmid 2a=b=2crangle,$$
I can simplify it as $$langle a,cmid 2a=2crangleconglangle a,a-cmid 2(a-c)ranglecongmathbb{Z}oplusmathbb{Z}_2.$$
How about for more complicated presentations such as
$$langle a,b,cmid 2a=3b=5crangle?$$
How do I simplify it, if possible?
In general, I am interested in simplifying
$$langle a,b,cmid n_1a=n_2b=n_3crangle,$$
where $n_1,n_2,n_3inmathbb{Z}$.
Thanks.
abstract-algebra group-theory group-presentation combinatorial-group-theory
abstract-algebra group-theory group-presentation combinatorial-group-theory
edited Dec 3 '18 at 0:43
Shaun
8,893113681
asked Feb 5 '18 at 7:41
yoyosteinyoyostein
7,91593768
edited Dec 3 '18 at 0:43
Shaun
8,893113681
asked Feb 5 '18 at 7:41
yoyosteinyoyostein
7,91593768
edited Dec 3 '18 at 0:43
Shaun
8,893113681
edited Dec 3 '18 at 0:43
Shaun
8,893113681
edited Dec 3 '18 at 0:43
Shaun
8,893113681
8,893113681
asked Feb 5 '18 at 7:41
yoyosteinyoyostein
7,91593768
asked Feb 5 '18 at 7:41
yoyosteinyoyostein
7,91593768
asked Feb 5 '18 at 7:41
yoyosteinyoyostein
7,91593768
7,91593768
2
$begingroup$
The general method for this problem is the Smith Normal Form diagonlization algorithm for matrices over the integers.
$endgroup$
– Derek Holt
Feb 5 '18 at 9:46
add a comment |
2
$begingroup$
The general method for this problem is the Smith Normal Form diagonlization algorithm for matrices over the integers.
$endgroup$
– Derek Holt
Feb 5 '18 at 9:46
2
2
$begingroup$
The general method for this problem is the Smith Normal Form diagonlization algorithm for matrices over the integers.
$endgroup$
– Derek Holt
Feb 5 '18 at 9:46
$begingroup$
The general method for this problem is the Smith Normal Form diagonlization algorithm for matrices over the integers.
$endgroup$
– Derek Holt
Feb 5 '18 at 9:46
add a comment |
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%2f2636708%2fis-there-a-general-way-to-simplify-such-group-presentations-free-abelian-group%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%2f2636708%2fis-there-a-general-way-to-simplify-such-group-presentations-free-abelian-group%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
2
$begingroup$
The general method for this problem is the Smith Normal Form diagonlization algorithm for matrices over the integers.
$endgroup$
– Derek Holt
Feb 5 '18 at 9:46