Young diagram for $S_5$












2














I am trying to draw the Young diagram for $S_5$. I know the following pieces of information about $S_5$.




  1. The order of the group is $120$.

  2. The number of conjugacy classes and so partitions is $7$.

  3. Degrees of irreducible representations $1,1,4,4,5,5,6$.

  4. The partition is $1 + 10 + 15 + 20 + 20 + 24 + 30 = 120$.


I understand that the Young diagram should contain $30$ boxes in the first row, $24$ boxes in the second row, $20$ boxes in the third and fourth rows, $15$ boxes in the fifth row, $10$ boxes in the sixth row and $1$ box in the seventh row.



So, the Young diagram is as follows.



My question:



Am I doing it right? I understand that the next step is to fill up the boxes to make it a Young tableau.



enter image description here



UPDATE 1:



I was able to compute the partition as follows.



enter image description here



What should be my next step?



UPDATE 2:



I think I was able to draw the Young diagrams.



enter image description here










share|cite|improve this question




















  • 2




    It's not clear what you are trying to do here. Each irreducible representation of $S_5$ is associated with a partition and young diagram, but what is the "young diagram of $S_5$"? Why do you need to make it into a young tableau?
    – Jair Taylor
    Dec 5 '15 at 0:42








  • 1




    Is this a homework question? It might help if you state the problem.
    – Jair Taylor
    Dec 5 '15 at 0:44










  • @JairTaylor, this is not a homework problem. I am trying to compute all the irreps of $S_5$. I am done with trivial, parity, standard and product of sign and standard representations. To compute the rest three, I am going through Young Tableaux and the Representations of the Symmetric Group by Jeremy Booher. It is suggested in that note that a more systematic approach is to work out the Young diagram and Young tableaux first.
    – Omar Shehab
    Dec 5 '15 at 0:49






  • 2




    A Young diagram for $S_5$ should correspond to a partition of 5, not 5!
    – Max
    Dec 5 '15 at 1:05






  • 1




    Each irrep will correspond to a partition of 5. So the $7$ associated partitions are $5$, $41$,$32$,$311$,$221$,$2111$,$11111$. If you count the number of standard young tableaux for each of these shapes you will get the dimension of each irrep.
    – Jair Taylor
    Dec 5 '15 at 1:12
















2














I am trying to draw the Young diagram for $S_5$. I know the following pieces of information about $S_5$.




  1. The order of the group is $120$.

  2. The number of conjugacy classes and so partitions is $7$.

  3. Degrees of irreducible representations $1,1,4,4,5,5,6$.

  4. The partition is $1 + 10 + 15 + 20 + 20 + 24 + 30 = 120$.


I understand that the Young diagram should contain $30$ boxes in the first row, $24$ boxes in the second row, $20$ boxes in the third and fourth rows, $15$ boxes in the fifth row, $10$ boxes in the sixth row and $1$ box in the seventh row.



So, the Young diagram is as follows.



My question:



Am I doing it right? I understand that the next step is to fill up the boxes to make it a Young tableau.



enter image description here



UPDATE 1:



I was able to compute the partition as follows.



enter image description here



What should be my next step?



UPDATE 2:



I think I was able to draw the Young diagrams.



enter image description here










share|cite|improve this question




















  • 2




    It's not clear what you are trying to do here. Each irreducible representation of $S_5$ is associated with a partition and young diagram, but what is the "young diagram of $S_5$"? Why do you need to make it into a young tableau?
    – Jair Taylor
    Dec 5 '15 at 0:42








  • 1




    Is this a homework question? It might help if you state the problem.
    – Jair Taylor
    Dec 5 '15 at 0:44










  • @JairTaylor, this is not a homework problem. I am trying to compute all the irreps of $S_5$. I am done with trivial, parity, standard and product of sign and standard representations. To compute the rest three, I am going through Young Tableaux and the Representations of the Symmetric Group by Jeremy Booher. It is suggested in that note that a more systematic approach is to work out the Young diagram and Young tableaux first.
    – Omar Shehab
    Dec 5 '15 at 0:49






  • 2




    A Young diagram for $S_5$ should correspond to a partition of 5, not 5!
    – Max
    Dec 5 '15 at 1:05






  • 1




    Each irrep will correspond to a partition of 5. So the $7$ associated partitions are $5$, $41$,$32$,$311$,$221$,$2111$,$11111$. If you count the number of standard young tableaux for each of these shapes you will get the dimension of each irrep.
    – Jair Taylor
    Dec 5 '15 at 1:12














2












2








2







I am trying to draw the Young diagram for $S_5$. I know the following pieces of information about $S_5$.




  1. The order of the group is $120$.

  2. The number of conjugacy classes and so partitions is $7$.

  3. Degrees of irreducible representations $1,1,4,4,5,5,6$.

  4. The partition is $1 + 10 + 15 + 20 + 20 + 24 + 30 = 120$.


I understand that the Young diagram should contain $30$ boxes in the first row, $24$ boxes in the second row, $20$ boxes in the third and fourth rows, $15$ boxes in the fifth row, $10$ boxes in the sixth row and $1$ box in the seventh row.



So, the Young diagram is as follows.



My question:



Am I doing it right? I understand that the next step is to fill up the boxes to make it a Young tableau.



enter image description here



UPDATE 1:



I was able to compute the partition as follows.



enter image description here



What should be my next step?



UPDATE 2:



I think I was able to draw the Young diagrams.



enter image description here










share|cite|improve this question















I am trying to draw the Young diagram for $S_5$. I know the following pieces of information about $S_5$.




  1. The order of the group is $120$.

  2. The number of conjugacy classes and so partitions is $7$.

  3. Degrees of irreducible representations $1,1,4,4,5,5,6$.

  4. The partition is $1 + 10 + 15 + 20 + 20 + 24 + 30 = 120$.


I understand that the Young diagram should contain $30$ boxes in the first row, $24$ boxes in the second row, $20$ boxes in the third and fourth rows, $15$ boxes in the fifth row, $10$ boxes in the sixth row and $1$ box in the seventh row.



So, the Young diagram is as follows.



My question:



Am I doing it right? I understand that the next step is to fill up the boxes to make it a Young tableau.



enter image description here



UPDATE 1:



I was able to compute the partition as follows.



enter image description here



What should be my next step?



UPDATE 2:



I think I was able to draw the Young diagrams.



enter image description here







abstract-algebra finite-groups representation-theory symmetric-groups young-tableaux






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 5 '15 at 6:11

























asked Dec 5 '15 at 0:18









Omar Shehab

619618




619618








  • 2




    It's not clear what you are trying to do here. Each irreducible representation of $S_5$ is associated with a partition and young diagram, but what is the "young diagram of $S_5$"? Why do you need to make it into a young tableau?
    – Jair Taylor
    Dec 5 '15 at 0:42








  • 1




    Is this a homework question? It might help if you state the problem.
    – Jair Taylor
    Dec 5 '15 at 0:44










  • @JairTaylor, this is not a homework problem. I am trying to compute all the irreps of $S_5$. I am done with trivial, parity, standard and product of sign and standard representations. To compute the rest three, I am going through Young Tableaux and the Representations of the Symmetric Group by Jeremy Booher. It is suggested in that note that a more systematic approach is to work out the Young diagram and Young tableaux first.
    – Omar Shehab
    Dec 5 '15 at 0:49






  • 2




    A Young diagram for $S_5$ should correspond to a partition of 5, not 5!
    – Max
    Dec 5 '15 at 1:05






  • 1




    Each irrep will correspond to a partition of 5. So the $7$ associated partitions are $5$, $41$,$32$,$311$,$221$,$2111$,$11111$. If you count the number of standard young tableaux for each of these shapes you will get the dimension of each irrep.
    – Jair Taylor
    Dec 5 '15 at 1:12














  • 2




    It's not clear what you are trying to do here. Each irreducible representation of $S_5$ is associated with a partition and young diagram, but what is the "young diagram of $S_5$"? Why do you need to make it into a young tableau?
    – Jair Taylor
    Dec 5 '15 at 0:42








  • 1




    Is this a homework question? It might help if you state the problem.
    – Jair Taylor
    Dec 5 '15 at 0:44










  • @JairTaylor, this is not a homework problem. I am trying to compute all the irreps of $S_5$. I am done with trivial, parity, standard and product of sign and standard representations. To compute the rest three, I am going through Young Tableaux and the Representations of the Symmetric Group by Jeremy Booher. It is suggested in that note that a more systematic approach is to work out the Young diagram and Young tableaux first.
    – Omar Shehab
    Dec 5 '15 at 0:49






  • 2




    A Young diagram for $S_5$ should correspond to a partition of 5, not 5!
    – Max
    Dec 5 '15 at 1:05






  • 1




    Each irrep will correspond to a partition of 5. So the $7$ associated partitions are $5$, $41$,$32$,$311$,$221$,$2111$,$11111$. If you count the number of standard young tableaux for each of these shapes you will get the dimension of each irrep.
    – Jair Taylor
    Dec 5 '15 at 1:12








2




2




It's not clear what you are trying to do here. Each irreducible representation of $S_5$ is associated with a partition and young diagram, but what is the "young diagram of $S_5$"? Why do you need to make it into a young tableau?
– Jair Taylor
Dec 5 '15 at 0:42






It's not clear what you are trying to do here. Each irreducible representation of $S_5$ is associated with a partition and young diagram, but what is the "young diagram of $S_5$"? Why do you need to make it into a young tableau?
– Jair Taylor
Dec 5 '15 at 0:42






1




1




Is this a homework question? It might help if you state the problem.
– Jair Taylor
Dec 5 '15 at 0:44




Is this a homework question? It might help if you state the problem.
– Jair Taylor
Dec 5 '15 at 0:44












@JairTaylor, this is not a homework problem. I am trying to compute all the irreps of $S_5$. I am done with trivial, parity, standard and product of sign and standard representations. To compute the rest three, I am going through Young Tableaux and the Representations of the Symmetric Group by Jeremy Booher. It is suggested in that note that a more systematic approach is to work out the Young diagram and Young tableaux first.
– Omar Shehab
Dec 5 '15 at 0:49




@JairTaylor, this is not a homework problem. I am trying to compute all the irreps of $S_5$. I am done with trivial, parity, standard and product of sign and standard representations. To compute the rest three, I am going through Young Tableaux and the Representations of the Symmetric Group by Jeremy Booher. It is suggested in that note that a more systematic approach is to work out the Young diagram and Young tableaux first.
– Omar Shehab
Dec 5 '15 at 0:49




2




2




A Young diagram for $S_5$ should correspond to a partition of 5, not 5!
– Max
Dec 5 '15 at 1:05




A Young diagram for $S_5$ should correspond to a partition of 5, not 5!
– Max
Dec 5 '15 at 1:05




1




1




Each irrep will correspond to a partition of 5. So the $7$ associated partitions are $5$, $41$,$32$,$311$,$221$,$2111$,$11111$. If you count the number of standard young tableaux for each of these shapes you will get the dimension of each irrep.
– Jair Taylor
Dec 5 '15 at 1:12




Each irrep will correspond to a partition of 5. So the $7$ associated partitions are $5$, $41$,$32$,$311$,$221$,$2111$,$11111$. If you count the number of standard young tableaux for each of these shapes you will get the dimension of each irrep.
– Jair Taylor
Dec 5 '15 at 1:12










1 Answer
1






active

oldest

votes


















0














I do not think your first attempt is right, but it seems your updates are much more succesful. The partitions of $5$ are
$$
{{5},{4,1},{3,2},{3,1,1},{2,2,1},{2,1,1,1},{1,1,1,1,1}}
$$

so your Young diagram will have $5$ boxes. If ${lambda_1,lambda_2,ldots,lambda_p}$ is one of the above partitions, then the corresponding Young diagram will have $lambda_1$ boxes on row $1$, $lambda_2$ boxes on row $2$ and so forth, up to $lambda_p$ boxes on row $p$, with $ple 5$, in agreement with your second update.



One can use instead of Young diagrams so-called Ferrers diagrams, which are basically Young diagrams with boxes replaced by dots, and more amenable to MathJax than boxes. Those would be (I don't have much control over the spacings forgive me)
$$
bulletbulletbulletbulletbullet, qquad
stackrel{Largebullet,bullet,bullet,bullet}{bulletphantom{Ecdot cdotcdot}}
, ,qquad
stackrel{Largebullet,bullet,bullet}{bulletbulletphantom{cdot}} qquad
stackrel{Largebulletbullet}{stackrel{Largebulletphantom{e}}{bulletphantom{e}}}
$$

etc. for the partitions ${5}, {4,1}, {3,2} ,{3,1,1}$ respectively. The character table is
$$
left(
begin{array}{ccccccc}
1 & 1 & 1 & 1 & 1 & 1 & 1 \
-1 & 0 & -1 & 1 & 0 & 2 & 4 \
0 & -1 & 1 & -1 & 1 & 1 & 5 \
1 & 0 & 0 & 0 & -2 & 0 & 6 \
0 & 1 & -1 & -1 & 1 & -1 & 5 \
-1 & 0 & 1 & 1 & 0 & -2 & 4 \
1 & -1 & -1 & 1 & 1 & -1 & 1 \
end{array}
right), .
$$






share|cite|improve this answer





















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


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1560443%2fyoung-diagram-for-s-5%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









    0














    I do not think your first attempt is right, but it seems your updates are much more succesful. The partitions of $5$ are
    $$
    {{5},{4,1},{3,2},{3,1,1},{2,2,1},{2,1,1,1},{1,1,1,1,1}}
    $$

    so your Young diagram will have $5$ boxes. If ${lambda_1,lambda_2,ldots,lambda_p}$ is one of the above partitions, then the corresponding Young diagram will have $lambda_1$ boxes on row $1$, $lambda_2$ boxes on row $2$ and so forth, up to $lambda_p$ boxes on row $p$, with $ple 5$, in agreement with your second update.



    One can use instead of Young diagrams so-called Ferrers diagrams, which are basically Young diagrams with boxes replaced by dots, and more amenable to MathJax than boxes. Those would be (I don't have much control over the spacings forgive me)
    $$
    bulletbulletbulletbulletbullet, qquad
    stackrel{Largebullet,bullet,bullet,bullet}{bulletphantom{Ecdot cdotcdot}}
    , ,qquad
    stackrel{Largebullet,bullet,bullet}{bulletbulletphantom{cdot}} qquad
    stackrel{Largebulletbullet}{stackrel{Largebulletphantom{e}}{bulletphantom{e}}}
    $$

    etc. for the partitions ${5}, {4,1}, {3,2} ,{3,1,1}$ respectively. The character table is
    $$
    left(
    begin{array}{ccccccc}
    1 & 1 & 1 & 1 & 1 & 1 & 1 \
    -1 & 0 & -1 & 1 & 0 & 2 & 4 \
    0 & -1 & 1 & -1 & 1 & 1 & 5 \
    1 & 0 & 0 & 0 & -2 & 0 & 6 \
    0 & 1 & -1 & -1 & 1 & -1 & 5 \
    -1 & 0 & 1 & 1 & 0 & -2 & 4 \
    1 & -1 & -1 & 1 & 1 & -1 & 1 \
    end{array}
    right), .
    $$






    share|cite|improve this answer


























      0














      I do not think your first attempt is right, but it seems your updates are much more succesful. The partitions of $5$ are
      $$
      {{5},{4,1},{3,2},{3,1,1},{2,2,1},{2,1,1,1},{1,1,1,1,1}}
      $$

      so your Young diagram will have $5$ boxes. If ${lambda_1,lambda_2,ldots,lambda_p}$ is one of the above partitions, then the corresponding Young diagram will have $lambda_1$ boxes on row $1$, $lambda_2$ boxes on row $2$ and so forth, up to $lambda_p$ boxes on row $p$, with $ple 5$, in agreement with your second update.



      One can use instead of Young diagrams so-called Ferrers diagrams, which are basically Young diagrams with boxes replaced by dots, and more amenable to MathJax than boxes. Those would be (I don't have much control over the spacings forgive me)
      $$
      bulletbulletbulletbulletbullet, qquad
      stackrel{Largebullet,bullet,bullet,bullet}{bulletphantom{Ecdot cdotcdot}}
      , ,qquad
      stackrel{Largebullet,bullet,bullet}{bulletbulletphantom{cdot}} qquad
      stackrel{Largebulletbullet}{stackrel{Largebulletphantom{e}}{bulletphantom{e}}}
      $$

      etc. for the partitions ${5}, {4,1}, {3,2} ,{3,1,1}$ respectively. The character table is
      $$
      left(
      begin{array}{ccccccc}
      1 & 1 & 1 & 1 & 1 & 1 & 1 \
      -1 & 0 & -1 & 1 & 0 & 2 & 4 \
      0 & -1 & 1 & -1 & 1 & 1 & 5 \
      1 & 0 & 0 & 0 & -2 & 0 & 6 \
      0 & 1 & -1 & -1 & 1 & -1 & 5 \
      -1 & 0 & 1 & 1 & 0 & -2 & 4 \
      1 & -1 & -1 & 1 & 1 & -1 & 1 \
      end{array}
      right), .
      $$






      share|cite|improve this answer
























        0












        0








        0






        I do not think your first attempt is right, but it seems your updates are much more succesful. The partitions of $5$ are
        $$
        {{5},{4,1},{3,2},{3,1,1},{2,2,1},{2,1,1,1},{1,1,1,1,1}}
        $$

        so your Young diagram will have $5$ boxes. If ${lambda_1,lambda_2,ldots,lambda_p}$ is one of the above partitions, then the corresponding Young diagram will have $lambda_1$ boxes on row $1$, $lambda_2$ boxes on row $2$ and so forth, up to $lambda_p$ boxes on row $p$, with $ple 5$, in agreement with your second update.



        One can use instead of Young diagrams so-called Ferrers diagrams, which are basically Young diagrams with boxes replaced by dots, and more amenable to MathJax than boxes. Those would be (I don't have much control over the spacings forgive me)
        $$
        bulletbulletbulletbulletbullet, qquad
        stackrel{Largebullet,bullet,bullet,bullet}{bulletphantom{Ecdot cdotcdot}}
        , ,qquad
        stackrel{Largebullet,bullet,bullet}{bulletbulletphantom{cdot}} qquad
        stackrel{Largebulletbullet}{stackrel{Largebulletphantom{e}}{bulletphantom{e}}}
        $$

        etc. for the partitions ${5}, {4,1}, {3,2} ,{3,1,1}$ respectively. The character table is
        $$
        left(
        begin{array}{ccccccc}
        1 & 1 & 1 & 1 & 1 & 1 & 1 \
        -1 & 0 & -1 & 1 & 0 & 2 & 4 \
        0 & -1 & 1 & -1 & 1 & 1 & 5 \
        1 & 0 & 0 & 0 & -2 & 0 & 6 \
        0 & 1 & -1 & -1 & 1 & -1 & 5 \
        -1 & 0 & 1 & 1 & 0 & -2 & 4 \
        1 & -1 & -1 & 1 & 1 & -1 & 1 \
        end{array}
        right), .
        $$






        share|cite|improve this answer












        I do not think your first attempt is right, but it seems your updates are much more succesful. The partitions of $5$ are
        $$
        {{5},{4,1},{3,2},{3,1,1},{2,2,1},{2,1,1,1},{1,1,1,1,1}}
        $$

        so your Young diagram will have $5$ boxes. If ${lambda_1,lambda_2,ldots,lambda_p}$ is one of the above partitions, then the corresponding Young diagram will have $lambda_1$ boxes on row $1$, $lambda_2$ boxes on row $2$ and so forth, up to $lambda_p$ boxes on row $p$, with $ple 5$, in agreement with your second update.



        One can use instead of Young diagrams so-called Ferrers diagrams, which are basically Young diagrams with boxes replaced by dots, and more amenable to MathJax than boxes. Those would be (I don't have much control over the spacings forgive me)
        $$
        bulletbulletbulletbulletbullet, qquad
        stackrel{Largebullet,bullet,bullet,bullet}{bulletphantom{Ecdot cdotcdot}}
        , ,qquad
        stackrel{Largebullet,bullet,bullet}{bulletbulletphantom{cdot}} qquad
        stackrel{Largebulletbullet}{stackrel{Largebulletphantom{e}}{bulletphantom{e}}}
        $$

        etc. for the partitions ${5}, {4,1}, {3,2} ,{3,1,1}$ respectively. The character table is
        $$
        left(
        begin{array}{ccccccc}
        1 & 1 & 1 & 1 & 1 & 1 & 1 \
        -1 & 0 & -1 & 1 & 0 & 2 & 4 \
        0 & -1 & 1 & -1 & 1 & 1 & 5 \
        1 & 0 & 0 & 0 & -2 & 0 & 6 \
        0 & 1 & -1 & -1 & 1 & -1 & 5 \
        -1 & 0 & 1 & 1 & 0 & -2 & 4 \
        1 & -1 & -1 & 1 & 1 & -1 & 1 \
        end{array}
        right), .
        $$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 2 '18 at 22:35









        ZeroTheHero

        15615




        15615






























            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%2f1560443%2fyoung-diagram-for-s-5%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

            Tonle Sap (See)

            I get strange results when I access the Sqlitedatabase with Unity C# via XAMPP

            Guatemaltekische Davis-Cup-Mannschaft