Symmetric group, Braid Groups, and related groups











up vote
1
down vote

favorite












The symmetric group, in terms of presentation, is given by a group with generators $x_1,x_2,cdots,x_n$ with following types of relations:



(R1) $x_1x_{i+1}x_i=x_{i+1}x_ix_{i+1}$



(R2) $x_ix_j=x_jx_i$ for $|i-j|geq 2$



(R3) $x_i^2=1$



There is a class of groups which are closely related with this group. The Braid group $B_n$ has presentation:



$$B_n=langle x_1,x_2,cdots,x_n : R1, R2rangle.$$
In other words, dropping relations (R3) from above presentation of symmetric group, we get Braid group. Then my question is



Question: If we drop relations (R1) or (R2) from presentation of $S_n$, what kind of groups we get? Are they finite? Are these groups studied well?










share|cite|improve this question
























  • Well, if you replace (R1) by something suitable you get Coxeter groups of other types than $A$ (with possibly some small adjustments to (R2) for some types).
    – Tobias Kildetoft
    Jun 7 '16 at 8:44










  • You mean: the relations (R1) (using (R3)) can be written as $(x_ix_{i+1})^3=1$; instead of this, we write $(x_ix_{i+1})^n_i=1$, then we get Coxeter group.
    – p Groups
    Jun 7 '16 at 8:46










  • Yes, precisely (or we can remove the condition by letting the element have infinite order, which obviously gives an infinite group).
    – Tobias Kildetoft
    Jun 7 '16 at 8:50










  • Also note that is may be more suggestive to write all the relations here in the form $(xy)^n = 1$ for some $n$.
    – Tobias Kildetoft
    Jun 7 '16 at 9:11















up vote
1
down vote

favorite












The symmetric group, in terms of presentation, is given by a group with generators $x_1,x_2,cdots,x_n$ with following types of relations:



(R1) $x_1x_{i+1}x_i=x_{i+1}x_ix_{i+1}$



(R2) $x_ix_j=x_jx_i$ for $|i-j|geq 2$



(R3) $x_i^2=1$



There is a class of groups which are closely related with this group. The Braid group $B_n$ has presentation:



$$B_n=langle x_1,x_2,cdots,x_n : R1, R2rangle.$$
In other words, dropping relations (R3) from above presentation of symmetric group, we get Braid group. Then my question is



Question: If we drop relations (R1) or (R2) from presentation of $S_n$, what kind of groups we get? Are they finite? Are these groups studied well?










share|cite|improve this question
























  • Well, if you replace (R1) by something suitable you get Coxeter groups of other types than $A$ (with possibly some small adjustments to (R2) for some types).
    – Tobias Kildetoft
    Jun 7 '16 at 8:44










  • You mean: the relations (R1) (using (R3)) can be written as $(x_ix_{i+1})^3=1$; instead of this, we write $(x_ix_{i+1})^n_i=1$, then we get Coxeter group.
    – p Groups
    Jun 7 '16 at 8:46










  • Yes, precisely (or we can remove the condition by letting the element have infinite order, which obviously gives an infinite group).
    – Tobias Kildetoft
    Jun 7 '16 at 8:50










  • Also note that is may be more suggestive to write all the relations here in the form $(xy)^n = 1$ for some $n$.
    – Tobias Kildetoft
    Jun 7 '16 at 9:11













up vote
1
down vote

favorite









up vote
1
down vote

favorite











The symmetric group, in terms of presentation, is given by a group with generators $x_1,x_2,cdots,x_n$ with following types of relations:



(R1) $x_1x_{i+1}x_i=x_{i+1}x_ix_{i+1}$



(R2) $x_ix_j=x_jx_i$ for $|i-j|geq 2$



(R3) $x_i^2=1$



There is a class of groups which are closely related with this group. The Braid group $B_n$ has presentation:



$$B_n=langle x_1,x_2,cdots,x_n : R1, R2rangle.$$
In other words, dropping relations (R3) from above presentation of symmetric group, we get Braid group. Then my question is



Question: If we drop relations (R1) or (R2) from presentation of $S_n$, what kind of groups we get? Are they finite? Are these groups studied well?










share|cite|improve this question















The symmetric group, in terms of presentation, is given by a group with generators $x_1,x_2,cdots,x_n$ with following types of relations:



(R1) $x_1x_{i+1}x_i=x_{i+1}x_ix_{i+1}$



(R2) $x_ix_j=x_jx_i$ for $|i-j|geq 2$



(R3) $x_i^2=1$



There is a class of groups which are closely related with this group. The Braid group $B_n$ has presentation:



$$B_n=langle x_1,x_2,cdots,x_n : R1, R2rangle.$$
In other words, dropping relations (R3) from above presentation of symmetric group, we get Braid group. Then my question is



Question: If we drop relations (R1) or (R2) from presentation of $S_n$, what kind of groups we get? Are they finite? Are these groups studied well?







finite-groups symmetric-groups group-presentation






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 3 at 2:08









Shaun

8,100113577




8,100113577










asked Jun 7 '16 at 8:36









p Groups

6,1681028




6,1681028












  • Well, if you replace (R1) by something suitable you get Coxeter groups of other types than $A$ (with possibly some small adjustments to (R2) for some types).
    – Tobias Kildetoft
    Jun 7 '16 at 8:44










  • You mean: the relations (R1) (using (R3)) can be written as $(x_ix_{i+1})^3=1$; instead of this, we write $(x_ix_{i+1})^n_i=1$, then we get Coxeter group.
    – p Groups
    Jun 7 '16 at 8:46










  • Yes, precisely (or we can remove the condition by letting the element have infinite order, which obviously gives an infinite group).
    – Tobias Kildetoft
    Jun 7 '16 at 8:50










  • Also note that is may be more suggestive to write all the relations here in the form $(xy)^n = 1$ for some $n$.
    – Tobias Kildetoft
    Jun 7 '16 at 9:11


















  • Well, if you replace (R1) by something suitable you get Coxeter groups of other types than $A$ (with possibly some small adjustments to (R2) for some types).
    – Tobias Kildetoft
    Jun 7 '16 at 8:44










  • You mean: the relations (R1) (using (R3)) can be written as $(x_ix_{i+1})^3=1$; instead of this, we write $(x_ix_{i+1})^n_i=1$, then we get Coxeter group.
    – p Groups
    Jun 7 '16 at 8:46










  • Yes, precisely (or we can remove the condition by letting the element have infinite order, which obviously gives an infinite group).
    – Tobias Kildetoft
    Jun 7 '16 at 8:50










  • Also note that is may be more suggestive to write all the relations here in the form $(xy)^n = 1$ for some $n$.
    – Tobias Kildetoft
    Jun 7 '16 at 9:11
















Well, if you replace (R1) by something suitable you get Coxeter groups of other types than $A$ (with possibly some small adjustments to (R2) for some types).
– Tobias Kildetoft
Jun 7 '16 at 8:44




Well, if you replace (R1) by something suitable you get Coxeter groups of other types than $A$ (with possibly some small adjustments to (R2) for some types).
– Tobias Kildetoft
Jun 7 '16 at 8:44












You mean: the relations (R1) (using (R3)) can be written as $(x_ix_{i+1})^3=1$; instead of this, we write $(x_ix_{i+1})^n_i=1$, then we get Coxeter group.
– p Groups
Jun 7 '16 at 8:46




You mean: the relations (R1) (using (R3)) can be written as $(x_ix_{i+1})^3=1$; instead of this, we write $(x_ix_{i+1})^n_i=1$, then we get Coxeter group.
– p Groups
Jun 7 '16 at 8:46












Yes, precisely (or we can remove the condition by letting the element have infinite order, which obviously gives an infinite group).
– Tobias Kildetoft
Jun 7 '16 at 8:50




Yes, precisely (or we can remove the condition by letting the element have infinite order, which obviously gives an infinite group).
– Tobias Kildetoft
Jun 7 '16 at 8:50












Also note that is may be more suggestive to write all the relations here in the form $(xy)^n = 1$ for some $n$.
– Tobias Kildetoft
Jun 7 '16 at 9:11




Also note that is may be more suggestive to write all the relations here in the form $(xy)^n = 1$ for some $n$.
– Tobias Kildetoft
Jun 7 '16 at 9:11















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',
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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1816878%2fsymmetric-group-braid-groups-and-related-groups%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































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.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • 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.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1816878%2fsymmetric-group-braid-groups-and-related-groups%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Bressuire

Cabo Verde

Gyllenstierna