Number of permutations that map every part of a particular partition away from itself












4














Let $C_1={1,2,dots,c_1}, space C_2={c_1+1, dots,c_2}, dots space C_k={c_{k-1}+1,dots, n}$ be a partition of the set ${1,2,dots n}$.



I want to calculate the number of permutations $sigma in S_n$ that don't take any element in any part of the partition to that same part; that is, the number



$$a_C = #{sigmain S_n space | space forall k : forall j in C_k : sigma(j) notin C_k}$$





My thoughts and "conjectures" on the problem:





  • A special case when $|C_j|=d$ is constant and $n=kd$.




    • A further special case of this is $d=4, k=13$ (and $n=52$). This corresponds to a card game where the deck is gone through one card at a time and at the same time counted $1,2,dots, 13,1,2,dots, 13,1,2,dots, 13,1,2,dots, 13 $. If at any point the number said out loud matches the value of the card laid down (suit doesn't matter), the game is lost. Otherwise, if the end is reached without matches, the game is won. (Trying to calculate the winning probability of this game is how I came up with the general problem.)


    • The case $d=1$ gives the permutations without fixed points. For these the fraction $frac{a_n}{n!} to frac{1}{e}$ as $nto infty$. I suspect that for other values of $d$ the limit is $frac{1}{e^d}$ but I can't find a proof for this. Still, simulation seems to support the claim and there's the heuristic argument that if the events $sigma(j) notin C_k$ were independent, the probability of "$sigma$ to be good" would be $(1-frac{d}{n})^n to e^{-d}$.




  • For some partitions $a_C=0$: if one part has more than $n/2$ elements, some element must stay in that part after permuting.











share|cite|improve this question



























    4














    Let $C_1={1,2,dots,c_1}, space C_2={c_1+1, dots,c_2}, dots space C_k={c_{k-1}+1,dots, n}$ be a partition of the set ${1,2,dots n}$.



    I want to calculate the number of permutations $sigma in S_n$ that don't take any element in any part of the partition to that same part; that is, the number



    $$a_C = #{sigmain S_n space | space forall k : forall j in C_k : sigma(j) notin C_k}$$





    My thoughts and "conjectures" on the problem:





    • A special case when $|C_j|=d$ is constant and $n=kd$.




      • A further special case of this is $d=4, k=13$ (and $n=52$). This corresponds to a card game where the deck is gone through one card at a time and at the same time counted $1,2,dots, 13,1,2,dots, 13,1,2,dots, 13,1,2,dots, 13 $. If at any point the number said out loud matches the value of the card laid down (suit doesn't matter), the game is lost. Otherwise, if the end is reached without matches, the game is won. (Trying to calculate the winning probability of this game is how I came up with the general problem.)


      • The case $d=1$ gives the permutations without fixed points. For these the fraction $frac{a_n}{n!} to frac{1}{e}$ as $nto infty$. I suspect that for other values of $d$ the limit is $frac{1}{e^d}$ but I can't find a proof for this. Still, simulation seems to support the claim and there's the heuristic argument that if the events $sigma(j) notin C_k$ were independent, the probability of "$sigma$ to be good" would be $(1-frac{d}{n})^n to e^{-d}$.




    • For some partitions $a_C=0$: if one part has more than $n/2$ elements, some element must stay in that part after permuting.











    share|cite|improve this question

























      4












      4








      4


      2





      Let $C_1={1,2,dots,c_1}, space C_2={c_1+1, dots,c_2}, dots space C_k={c_{k-1}+1,dots, n}$ be a partition of the set ${1,2,dots n}$.



      I want to calculate the number of permutations $sigma in S_n$ that don't take any element in any part of the partition to that same part; that is, the number



      $$a_C = #{sigmain S_n space | space forall k : forall j in C_k : sigma(j) notin C_k}$$





      My thoughts and "conjectures" on the problem:





      • A special case when $|C_j|=d$ is constant and $n=kd$.




        • A further special case of this is $d=4, k=13$ (and $n=52$). This corresponds to a card game where the deck is gone through one card at a time and at the same time counted $1,2,dots, 13,1,2,dots, 13,1,2,dots, 13,1,2,dots, 13 $. If at any point the number said out loud matches the value of the card laid down (suit doesn't matter), the game is lost. Otherwise, if the end is reached without matches, the game is won. (Trying to calculate the winning probability of this game is how I came up with the general problem.)


        • The case $d=1$ gives the permutations without fixed points. For these the fraction $frac{a_n}{n!} to frac{1}{e}$ as $nto infty$. I suspect that for other values of $d$ the limit is $frac{1}{e^d}$ but I can't find a proof for this. Still, simulation seems to support the claim and there's the heuristic argument that if the events $sigma(j) notin C_k$ were independent, the probability of "$sigma$ to be good" would be $(1-frac{d}{n})^n to e^{-d}$.




      • For some partitions $a_C=0$: if one part has more than $n/2$ elements, some element must stay in that part after permuting.











      share|cite|improve this question













      Let $C_1={1,2,dots,c_1}, space C_2={c_1+1, dots,c_2}, dots space C_k={c_{k-1}+1,dots, n}$ be a partition of the set ${1,2,dots n}$.



      I want to calculate the number of permutations $sigma in S_n$ that don't take any element in any part of the partition to that same part; that is, the number



      $$a_C = #{sigmain S_n space | space forall k : forall j in C_k : sigma(j) notin C_k}$$





      My thoughts and "conjectures" on the problem:





      • A special case when $|C_j|=d$ is constant and $n=kd$.




        • A further special case of this is $d=4, k=13$ (and $n=52$). This corresponds to a card game where the deck is gone through one card at a time and at the same time counted $1,2,dots, 13,1,2,dots, 13,1,2,dots, 13,1,2,dots, 13 $. If at any point the number said out loud matches the value of the card laid down (suit doesn't matter), the game is lost. Otherwise, if the end is reached without matches, the game is won. (Trying to calculate the winning probability of this game is how I came up with the general problem.)


        • The case $d=1$ gives the permutations without fixed points. For these the fraction $frac{a_n}{n!} to frac{1}{e}$ as $nto infty$. I suspect that for other values of $d$ the limit is $frac{1}{e^d}$ but I can't find a proof for this. Still, simulation seems to support the claim and there's the heuristic argument that if the events $sigma(j) notin C_k$ were independent, the probability of "$sigma$ to be good" would be $(1-frac{d}{n})^n to e^{-d}$.




      • For some partitions $a_C=0$: if one part has more than $n/2$ elements, some element must stay in that part after permuting.








      probability permutations






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Jun 13 '17 at 19:35









      ploosu2ploosu2

      4,5771023




      4,5771023






















          1 Answer
          1






          active

          oldest

          votes


















          0














          The answer is given by



          $$a_C = int_0^infty prod_{j=1}^k m_j! L_{m_j}(x) e^{-x} dx$$



          where $m_j = |C_j|$ and $L_t$ is $t$th Laguerre Polynomial (up to a sign).



          See the wikipedia entry on derangement generalizations. Notice here we distinguish the elements inside each class $C_j$, on contrast to Wikipedia's case where words and letters are considered. Therefore we multiply by $m_j!$ here (also notice: this is precisely the constant factor in front of each Laguerre Polynomial, so this amounts to just dropping that factor).






          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%2f2321435%2fnumber-of-permutations-that-map-every-part-of-a-particular-partition-away-from-i%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














            The answer is given by



            $$a_C = int_0^infty prod_{j=1}^k m_j! L_{m_j}(x) e^{-x} dx$$



            where $m_j = |C_j|$ and $L_t$ is $t$th Laguerre Polynomial (up to a sign).



            See the wikipedia entry on derangement generalizations. Notice here we distinguish the elements inside each class $C_j$, on contrast to Wikipedia's case where words and letters are considered. Therefore we multiply by $m_j!$ here (also notice: this is precisely the constant factor in front of each Laguerre Polynomial, so this amounts to just dropping that factor).






            share|cite|improve this answer


























              0














              The answer is given by



              $$a_C = int_0^infty prod_{j=1}^k m_j! L_{m_j}(x) e^{-x} dx$$



              where $m_j = |C_j|$ and $L_t$ is $t$th Laguerre Polynomial (up to a sign).



              See the wikipedia entry on derangement generalizations. Notice here we distinguish the elements inside each class $C_j$, on contrast to Wikipedia's case where words and letters are considered. Therefore we multiply by $m_j!$ here (also notice: this is precisely the constant factor in front of each Laguerre Polynomial, so this amounts to just dropping that factor).






              share|cite|improve this answer
























                0












                0








                0






                The answer is given by



                $$a_C = int_0^infty prod_{j=1}^k m_j! L_{m_j}(x) e^{-x} dx$$



                where $m_j = |C_j|$ and $L_t$ is $t$th Laguerre Polynomial (up to a sign).



                See the wikipedia entry on derangement generalizations. Notice here we distinguish the elements inside each class $C_j$, on contrast to Wikipedia's case where words and letters are considered. Therefore we multiply by $m_j!$ here (also notice: this is precisely the constant factor in front of each Laguerre Polynomial, so this amounts to just dropping that factor).






                share|cite|improve this answer












                The answer is given by



                $$a_C = int_0^infty prod_{j=1}^k m_j! L_{m_j}(x) e^{-x} dx$$



                where $m_j = |C_j|$ and $L_t$ is $t$th Laguerre Polynomial (up to a sign).



                See the wikipedia entry on derangement generalizations. Notice here we distinguish the elements inside each class $C_j$, on contrast to Wikipedia's case where words and letters are considered. Therefore we multiply by $m_j!$ here (also notice: this is precisely the constant factor in front of each Laguerre Polynomial, so this amounts to just dropping that factor).







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Dec 5 '18 at 10:20









                ploosu2ploosu2

                4,5771023




                4,5771023






























                    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%2f2321435%2fnumber-of-permutations-that-map-every-part-of-a-particular-partition-away-from-i%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

                    Berounka

                    Sphinx de Gizeh

                    Different font size/position of beamer's navigation symbols template's content depending on regular/plain...