Irreducible representations of symmetric group
$begingroup$
Thanks to characters of representation we know that exists a bijection between irreducible representations of a finite group G and its conjugate classes.
That bijection is proved showing that the cardinality of the two sets is the same. (J-P Serre, Linear Representations of finite groups, Th. 7 pag 19)
Is there a canonical bijection? I think the answer it's no for a generic group, but it seems to me that for the symmetric group things could be different.
abstract-algebra representation-theory young-tableaux
$endgroup$
add a comment |
$begingroup$
Thanks to characters of representation we know that exists a bijection between irreducible representations of a finite group G and its conjugate classes.
That bijection is proved showing that the cardinality of the two sets is the same. (J-P Serre, Linear Representations of finite groups, Th. 7 pag 19)
Is there a canonical bijection? I think the answer it's no for a generic group, but it seems to me that for the symmetric group things could be different.
abstract-algebra representation-theory young-tableaux
$endgroup$
3
$begingroup$
The keyword here is 'Young Tableaux'.
$endgroup$
– hellHound
Dec 30 '18 at 17:17
add a comment |
$begingroup$
Thanks to characters of representation we know that exists a bijection between irreducible representations of a finite group G and its conjugate classes.
That bijection is proved showing that the cardinality of the two sets is the same. (J-P Serre, Linear Representations of finite groups, Th. 7 pag 19)
Is there a canonical bijection? I think the answer it's no for a generic group, but it seems to me that for the symmetric group things could be different.
abstract-algebra representation-theory young-tableaux
$endgroup$
Thanks to characters of representation we know that exists a bijection between irreducible representations of a finite group G and its conjugate classes.
That bijection is proved showing that the cardinality of the two sets is the same. (J-P Serre, Linear Representations of finite groups, Th. 7 pag 19)
Is there a canonical bijection? I think the answer it's no for a generic group, but it seems to me that for the symmetric group things could be different.
abstract-algebra representation-theory young-tableaux
abstract-algebra representation-theory young-tableaux
edited Dec 30 '18 at 17:29
ecrin
asked Dec 30 '18 at 17:03
ecrinecrin
3477
3477
3
$begingroup$
The keyword here is 'Young Tableaux'.
$endgroup$
– hellHound
Dec 30 '18 at 17:17
add a comment |
3
$begingroup$
The keyword here is 'Young Tableaux'.
$endgroup$
– hellHound
Dec 30 '18 at 17:17
3
3
$begingroup$
The keyword here is 'Young Tableaux'.
$endgroup$
– hellHound
Dec 30 '18 at 17:17
$begingroup$
The keyword here is 'Young Tableaux'.
$endgroup$
– hellHound
Dec 30 '18 at 17:17
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Yes, there's a canonical bijection. Namely, there's a canonical bijection between conjugacy classes in the symmetric group $S_n$ and partitions of $n$, and there's a canonical bijection between partitions of $n$ and irreducible representations. There are many references, but see for example Young Tableaux by Fulton.
The construction in Fulton is not the only possible construction. However, it is commented in the book that all of the various methods of constructing the representations known at this point end up with the same bijection with partitions. Arguably you could call it a coincidence, but seeing the construction in terms of Young tableaux makes it hard to think of it as a coincidence.
$endgroup$
add a comment |
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%2f3057012%2firreducible-representations-of-symmetric-group%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Yes, there's a canonical bijection. Namely, there's a canonical bijection between conjugacy classes in the symmetric group $S_n$ and partitions of $n$, and there's a canonical bijection between partitions of $n$ and irreducible representations. There are many references, but see for example Young Tableaux by Fulton.
The construction in Fulton is not the only possible construction. However, it is commented in the book that all of the various methods of constructing the representations known at this point end up with the same bijection with partitions. Arguably you could call it a coincidence, but seeing the construction in terms of Young tableaux makes it hard to think of it as a coincidence.
$endgroup$
add a comment |
$begingroup$
Yes, there's a canonical bijection. Namely, there's a canonical bijection between conjugacy classes in the symmetric group $S_n$ and partitions of $n$, and there's a canonical bijection between partitions of $n$ and irreducible representations. There are many references, but see for example Young Tableaux by Fulton.
The construction in Fulton is not the only possible construction. However, it is commented in the book that all of the various methods of constructing the representations known at this point end up with the same bijection with partitions. Arguably you could call it a coincidence, but seeing the construction in terms of Young tableaux makes it hard to think of it as a coincidence.
$endgroup$
add a comment |
$begingroup$
Yes, there's a canonical bijection. Namely, there's a canonical bijection between conjugacy classes in the symmetric group $S_n$ and partitions of $n$, and there's a canonical bijection between partitions of $n$ and irreducible representations. There are many references, but see for example Young Tableaux by Fulton.
The construction in Fulton is not the only possible construction. However, it is commented in the book that all of the various methods of constructing the representations known at this point end up with the same bijection with partitions. Arguably you could call it a coincidence, but seeing the construction in terms of Young tableaux makes it hard to think of it as a coincidence.
$endgroup$
Yes, there's a canonical bijection. Namely, there's a canonical bijection between conjugacy classes in the symmetric group $S_n$ and partitions of $n$, and there's a canonical bijection between partitions of $n$ and irreducible representations. There are many references, but see for example Young Tableaux by Fulton.
The construction in Fulton is not the only possible construction. However, it is commented in the book that all of the various methods of constructing the representations known at this point end up with the same bijection with partitions. Arguably you could call it a coincidence, but seeing the construction in terms of Young tableaux makes it hard to think of it as a coincidence.
answered Jan 1 at 17:33
Matt SamuelMatt Samuel
38.6k63768
38.6k63768
add a comment |
add a comment |
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%2f3057012%2firreducible-representations-of-symmetric-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
3
$begingroup$
The keyword here is 'Young Tableaux'.
$endgroup$
– hellHound
Dec 30 '18 at 17:17