Is this true for every partitioning?












3














I have two categories (category1 and category2 ) and The size of both categories is equal to each other. if we partition each categories arbibtrary .Is this proposition proven? or rejected?



$n_T gt n_T' $ $implies$ $sum_{t=1}^T dbinom{t}{2} n_t gt sum_{t=1}^T dbinom{t}{2} n'_t$



consider the number of the partitions with size $t$ as $n_t$.and Suppose that the size of the largest partition is equal to $T$.



for example if size of each categories be equal to 33. we can partition one of them into one partitions with size 5 and one partitions with size 4 and two partitions with size 3 and seven partitions with size 2. (In other words , $n_5=1 , n_4 = 2 , n_3=2 , n_2 = 7$ because $5+2*4+2*3+7*2=33$) , And the size of the largest partition is 5.



now for category1 and category 2 suppose that



$T$ : the size of the largest partition in each category .(The value of $T$ is the same in both categories)



$n_t $: number of the partitions with size $t$ in category1.( $t=1,…,T$)



$n'_t$: number of the partitions with size $t$ in category2.( $t=1,…,T$)



Is this true for every partitioning?



$n_T' gt n_T' $ $implies$ $sum_{t=1}^T dbinom{t}{2} n_t gt sum_{t=1}^T dbinom{t}{2} n'_t$



I consider $dbinom{1}{2} = 0 $



until now I could not find a counterexample.



Thanks a lot for reading.






combinatorics combinations integer-partitions set-partition clustering







share|cite|improve this question






















  • Hi @Alex Ravsky Thanks a lot !
    – Richard
    Dec 1 '18 at 17:14
















3














I have two categories (category1 and category2 ) and The size of both categories is equal to each other. if we partition each categories arbibtrary .Is this proposition proven? or rejected?



$n_T gt n_T' $ $implies$ $sum_{t=1}^T dbinom{t}{2} n_t gt sum_{t=1}^T dbinom{t}{2} n'_t$



consider the number of the partitions with size $t$ as $n_t$.and Suppose that the size of the largest partition is equal to $T$.



for example if size of each categories be equal to 33. we can partition one of them into one partitions with size 5 and one partitions with size 4 and two partitions with size 3 and seven partitions with size 2. (In other words , $n_5=1 , n_4 = 2 , n_3=2 , n_2 = 7$ because $5+2*4+2*3+7*2=33$) , And the size of the largest partition is 5.



now for category1 and category 2 suppose that



$T$ : the size of the largest partition in each category .(The value of $T$ is the same in both categories)



$n_t $: number of the partitions with size $t$ in category1.( $t=1,…,T$)



$n'_t$: number of the partitions with size $t$ in category2.( $t=1,…,T$)



Is this true for every partitioning?



$n_T' gt n_T' $ $implies$ $sum_{t=1}^T dbinom{t}{2} n_t gt sum_{t=1}^T dbinom{t}{2} n'_t$



I consider $dbinom{1}{2} = 0 $



until now I could not find a counterexample.



Thanks a lot for reading.






combinatorics combinations integer-partitions set-partition clustering







share|cite|improve this question






















  • Hi @Alex Ravsky Thanks a lot !
    – Richard
    Dec 1 '18 at 17:14














3












3








3


2





I have two categories (category1 and category2 ) and The size of both categories is equal to each other. if we partition each categories arbibtrary .Is this proposition proven? or rejected?



$n_T gt n_T' $ $implies$ $sum_{t=1}^T dbinom{t}{2} n_t gt sum_{t=1}^T dbinom{t}{2} n'_t$



consider the number of the partitions with size $t$ as $n_t$.and Suppose that the size of the largest partition is equal to $T$.



for example if size of each categories be equal to 33. we can partition one of them into one partitions with size 5 and one partitions with size 4 and two partitions with size 3 and seven partitions with size 2. (In other words , $n_5=1 , n_4 = 2 , n_3=2 , n_2 = 7$ because $5+2*4+2*3+7*2=33$) , And the size of the largest partition is 5.



now for category1 and category 2 suppose that



$T$ : the size of the largest partition in each category .(The value of $T$ is the same in both categories)



$n_t $: number of the partitions with size $t$ in category1.( $t=1,…,T$)



$n'_t$: number of the partitions with size $t$ in category2.( $t=1,…,T$)



Is this true for every partitioning?



$n_T' gt n_T' $ $implies$ $sum_{t=1}^T dbinom{t}{2} n_t gt sum_{t=1}^T dbinom{t}{2} n'_t$



I consider $dbinom{1}{2} = 0 $



until now I could not find a counterexample.



Thanks a lot for reading.






combinatorics combinations integer-partitions set-partition clustering







share|cite|improve this question













I have two categories (category1 and category2 ) and The size of both categories is equal to each other. if we partition each categories arbibtrary .Is this proposition proven? or rejected?



$n_T gt n_T' $ $implies$ $sum_{t=1}^T dbinom{t}{2} n_t gt sum_{t=1}^T dbinom{t}{2} n'_t$



consider the number of the partitions with size $t$ as $n_t$.and Suppose that the size of the largest partition is equal to $T$.



for example if size of each categories be equal to 33. we can partition one of them into one partitions with size 5 and one partitions with size 4 and two partitions with size 3 and seven partitions with size 2. (In other words , $n_5=1 , n_4 = 2 , n_3=2 , n_2 = 7$ because $5+2*4+2*3+7*2=33$) , And the size of the largest partition is 5.



now for category1 and category 2 suppose that



$T$ : the size of the largest partition in each category .(The value of $T$ is the same in both categories)



$n_t $: number of the partitions with size $t$ in category1.( $t=1,…,T$)



$n'_t$: number of the partitions with size $t$ in category2.( $t=1,…,T$)



Is this true for every partitioning?



$n_T' gt n_T' $ $implies$ $sum_{t=1}^T dbinom{t}{2} n_t gt sum_{t=1}^T dbinom{t}{2} n'_t$



I consider $dbinom{1}{2} = 0 $



until now I could not find a counterexample.



Thanks a lot for reading.






combinatorics combinations integer-partitions set-partition clustering




combinatorics combinations integer-partitions set-partition clustering






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 30 '18 at 10:53









RichardRichard

265




265












  • Hi @Alex Ravsky Thanks a lot !
    – Richard
    Dec 1 '18 at 17:14


















  • Hi @Alex Ravsky Thanks a lot !
    – Richard
    Dec 1 '18 at 17:14
















Hi @Alex Ravsky Thanks a lot !
– Richard
Dec 1 '18 at 17:14




Hi @Alex Ravsky Thanks a lot !
– Richard
Dec 1 '18 at 17:14










1 Answer
1






active

oldest

votes


















1














If I understood your question right, the answer is negative. Consider two partitions of $11$ such that $n_3=2$, $n_2=0$, $n_1=5$, $n’_3=1$, $n_2=4$, and $n’_1=0$. Then $n_{3}>n’_3$, but
$$sum_{t=1}^T dbinom{t}{2} n_t=6<7=sum_{t=1}^T dbinom{t}{2} n'_t.$$






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%2f3019952%2fis-this-true-for-every-partitioning%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









    1














    If I understood your question right, the answer is negative. Consider two partitions of $11$ such that $n_3=2$, $n_2=0$, $n_1=5$, $n’_3=1$, $n_2=4$, and $n’_1=0$. Then $n_{3}>n’_3$, but
    $$sum_{t=1}^T dbinom{t}{2} n_t=6<7=sum_{t=1}^T dbinom{t}{2} n'_t.$$






    share|cite|improve this answer


























      1














      If I understood your question right, the answer is negative. Consider two partitions of $11$ such that $n_3=2$, $n_2=0$, $n_1=5$, $n’_3=1$, $n_2=4$, and $n’_1=0$. Then $n_{3}>n’_3$, but
      $$sum_{t=1}^T dbinom{t}{2} n_t=6<7=sum_{t=1}^T dbinom{t}{2} n'_t.$$






      share|cite|improve this answer
























        1












        1








        1






        If I understood your question right, the answer is negative. Consider two partitions of $11$ such that $n_3=2$, $n_2=0$, $n_1=5$, $n’_3=1$, $n_2=4$, and $n’_1=0$. Then $n_{3}>n’_3$, but
        $$sum_{t=1}^T dbinom{t}{2} n_t=6<7=sum_{t=1}^T dbinom{t}{2} n'_t.$$






        share|cite|improve this answer












        If I understood your question right, the answer is negative. Consider two partitions of $11$ such that $n_3=2$, $n_2=0$, $n_1=5$, $n’_3=1$, $n_2=4$, and $n’_1=0$. Then $n_{3}>n’_3$, but
        $$sum_{t=1}^T dbinom{t}{2} n_t=6<7=sum_{t=1}^T dbinom{t}{2} n'_t.$$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 1 '18 at 14:25









        Alex RavskyAlex Ravsky

        39.4k32181




        39.4k32181






























            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%2f3019952%2fis-this-true-for-every-partitioning%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

            Probability when a professor distributes a quiz and homework assignment to a class of n students.

            Image
            0 0 $begingroup$ Need help with this problem. Suppose our lazy professor collects a quiz and a homework assignment from a class of n students one day, then distributes both the quizzes and the homework assignments back to the class in a random fashion for grading. Each student receives one quiz and one homework assignment to grade. (a) What is the probability that every student receives someone else's quiz to grade, and someone else's homework to grade? (b) What is the probability that no student receives both their own quiz and their own homework assignment to grade? In this case, some students may receive their own quiz, and others may receive their own homework assignment. (c) Compute the limiting probability as n approaches infinity in each case. ...
            Read more

            Aardman Animations

            Image
            Aardman Animations, Ltd. Aardman Animations Tipo privada Atividade Animação em stop-motion , Animação em CGI Fundação 1972 Fundador(es) Peter Lord David Sproxton Sede Bristol, Inglaterra  Reino Unido Proprietário(s) Dreamworks Pessoas-chave Peter Lord David Sproxton Nick Park Divisões Aardman Features Aardman Digital Aardman Commercials Aardman Broadcast Aardman International Aardman Rights Aardman Effects Aardman 3-D Systems Aardman Nathan Love AardBoiled Website oficial aardman.com ...
            Read more

            Are they similar matrix

            Image
            0 $begingroup$ Do $begin{bmatrix} 0&i&0\0&0&1\0&0&0 end{bmatrix} $ and $begin{bmatrix} 0&0&0\-i&0&0\0&1&0 end{bmatrix} $ are similar.Is this True/false Clearly both are nilpotent and one is conjucate transpose of other but how to know if they are similar.i'm stuck. Please help me linear-algebra vector-spaces eigenvalues-eigenvectors generalizedeigenvector share | cite | improve this question edited Dec 10 '18 at 6:38 Vasanth Kris asked Dec 10 '18 at 6:19 ...
            Read more