Families of ordered set partitions with disjoint blocks The 2019 Stack Overflow Developer Survey Results Are InDeligne-Simpson problem in the symmetric groupProcreation with several gendersI am searching for the name of a partition (if it already exists)Existence problem for a generalisation of Latin squares (matrices with fixed row and column sets)Simple lower bounds for Bell numbers (number of set partitions)?Can a partition free family in $2^[n]$ always be enlarged to one of size $2^n-1$?Looking for N-dimensional spheres in the configuration space of the colorful Tverberg problemBalanced partitions of vector setsCan we cover a set by a particular family of sets?genus zero permutation and noncrossing partition

Families of ordered set partitions with disjoint blocks



The 2019 Stack Overflow Developer Survey Results Are InDeligne-Simpson problem in the symmetric groupProcreation with several gendersI am searching for the name of a partition (if it already exists)Existence problem for a generalisation of Latin squares (matrices with fixed row and column sets)Simple lower bounds for Bell numbers (number of set partitions)?Can a partition free family in $2^[n]$ always be enlarged to one of size $2^n-1$?Looking for N-dimensional spheres in the configuration space of the colorful Tverberg problemBalanced partitions of vector setsCan we cover a set by a particular family of sets?genus zero permutation and noncrossing partition










2












$begingroup$


Let $C_1,dots, C_m$ be a family of ordered set partitions of $[n]$ with exactly $k$ blocks.



Write $C_i = B_i1, dots, B_ik$ for $i=1,dots, m$ where $B_ij$ are the blocks of the ordered set partition $C_i$.



Suppose this family also has the property that for each $j=1,dots, k$



$$B_1j cup cdots cup B_mj$$



is also a partition of $[n]$



Can one determine the maximal number of members in such a family $m$, or at least a decent upper bound on $m$?



Edit:



It might also be worth noting that if we take $k=n$, then $m=n$ since this would be equivalent to the existence of a latin square. I am in particular interested in the case $k=2$.










share|cite|improve this question











$endgroup$
















    2












    $begingroup$


    Let $C_1,dots, C_m$ be a family of ordered set partitions of $[n]$ with exactly $k$ blocks.



    Write $C_i = B_i1, dots, B_ik$ for $i=1,dots, m$ where $B_ij$ are the blocks of the ordered set partition $C_i$.



    Suppose this family also has the property that for each $j=1,dots, k$



    $$B_1j cup cdots cup B_mj$$



    is also a partition of $[n]$



    Can one determine the maximal number of members in such a family $m$, or at least a decent upper bound on $m$?



    Edit:



    It might also be worth noting that if we take $k=n$, then $m=n$ since this would be equivalent to the existence of a latin square. I am in particular interested in the case $k=2$.










    share|cite|improve this question











    $endgroup$














      2












      2








      2





      $begingroup$


      Let $C_1,dots, C_m$ be a family of ordered set partitions of $[n]$ with exactly $k$ blocks.



      Write $C_i = B_i1, dots, B_ik$ for $i=1,dots, m$ where $B_ij$ are the blocks of the ordered set partition $C_i$.



      Suppose this family also has the property that for each $j=1,dots, k$



      $$B_1j cup cdots cup B_mj$$



      is also a partition of $[n]$



      Can one determine the maximal number of members in such a family $m$, or at least a decent upper bound on $m$?



      Edit:



      It might also be worth noting that if we take $k=n$, then $m=n$ since this would be equivalent to the existence of a latin square. I am in particular interested in the case $k=2$.










      share|cite|improve this question











      $endgroup$




      Let $C_1,dots, C_m$ be a family of ordered set partitions of $[n]$ with exactly $k$ blocks.



      Write $C_i = B_i1, dots, B_ik$ for $i=1,dots, m$ where $B_ij$ are the blocks of the ordered set partition $C_i$.



      Suppose this family also has the property that for each $j=1,dots, k$



      $$B_1j cup cdots cup B_mj$$



      is also a partition of $[n]$



      Can one determine the maximal number of members in such a family $m$, or at least a decent upper bound on $m$?



      Edit:



      It might also be worth noting that if we take $k=n$, then $m=n$ since this would be equivalent to the existence of a latin square. I am in particular interested in the case $k=2$.







      co.combinatorics partitions






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited 11 hours ago









      darij grinberg

      18.4k373188




      18.4k373188










      asked 14 hours ago









      user94267user94267

      1007




      1007




















          2 Answers
          2






          active

          oldest

          votes


















          3












          $begingroup$

          We have $$mn=sum_isum_j |B_ij|=sum_jsum_i |B_ij|=kn,$$
          thus $m=k$.






          share|cite|improve this answer









          $endgroup$




















            3












            $begingroup$

            Answer: $m=k$.



            Put indeed your blocks $B_ij$ in a $mtimes k$ array and then "read" this array:



            -- row-wise: any element of $[n]$ appears then $m$ times.



            -- column-wise: any element of $[n]$ appears then $k$ times.






            share|cite|improve this answer









            $endgroup$












            • $begingroup$
              26 seconds slower than Fedor, but my answer is better, does not use multiplication :)
              $endgroup$
              – Teo Banica
              13 hours ago










            • $begingroup$
              you actually multiply 1 by $m$ and by $k$ :)
              $endgroup$
              – Fedor Petrov
              13 hours ago











            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: "504"
            ;
            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%2fmathoverflow.net%2fquestions%2f327585%2ffamilies-of-ordered-set-partitions-with-disjoint-blocks%23new-answer', 'question_page');

            );

            Post as a guest















            Required, but never shown

























            2 Answers
            2






            active

            oldest

            votes








            2 Answers
            2






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            3












            $begingroup$

            We have $$mn=sum_isum_j |B_ij|=sum_jsum_i |B_ij|=kn,$$
            thus $m=k$.






            share|cite|improve this answer









            $endgroup$

















              3












              $begingroup$

              We have $$mn=sum_isum_j |B_ij|=sum_jsum_i |B_ij|=kn,$$
              thus $m=k$.






              share|cite|improve this answer









              $endgroup$















                3












                3








                3





                $begingroup$

                We have $$mn=sum_isum_j |B_ij|=sum_jsum_i |B_ij|=kn,$$
                thus $m=k$.






                share|cite|improve this answer









                $endgroup$



                We have $$mn=sum_isum_j |B_ij|=sum_jsum_i |B_ij|=kn,$$
                thus $m=k$.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered 13 hours ago









                Fedor PetrovFedor Petrov

                52.1k6122239




                52.1k6122239





















                    3












                    $begingroup$

                    Answer: $m=k$.



                    Put indeed your blocks $B_ij$ in a $mtimes k$ array and then "read" this array:



                    -- row-wise: any element of $[n]$ appears then $m$ times.



                    -- column-wise: any element of $[n]$ appears then $k$ times.






                    share|cite|improve this answer









                    $endgroup$












                    • $begingroup$
                      26 seconds slower than Fedor, but my answer is better, does not use multiplication :)
                      $endgroup$
                      – Teo Banica
                      13 hours ago










                    • $begingroup$
                      you actually multiply 1 by $m$ and by $k$ :)
                      $endgroup$
                      – Fedor Petrov
                      13 hours ago















                    3












                    $begingroup$

                    Answer: $m=k$.



                    Put indeed your blocks $B_ij$ in a $mtimes k$ array and then "read" this array:



                    -- row-wise: any element of $[n]$ appears then $m$ times.



                    -- column-wise: any element of $[n]$ appears then $k$ times.






                    share|cite|improve this answer









                    $endgroup$












                    • $begingroup$
                      26 seconds slower than Fedor, but my answer is better, does not use multiplication :)
                      $endgroup$
                      – Teo Banica
                      13 hours ago










                    • $begingroup$
                      you actually multiply 1 by $m$ and by $k$ :)
                      $endgroup$
                      – Fedor Petrov
                      13 hours ago













                    3












                    3








                    3





                    $begingroup$

                    Answer: $m=k$.



                    Put indeed your blocks $B_ij$ in a $mtimes k$ array and then "read" this array:



                    -- row-wise: any element of $[n]$ appears then $m$ times.



                    -- column-wise: any element of $[n]$ appears then $k$ times.






                    share|cite|improve this answer









                    $endgroup$



                    Answer: $m=k$.



                    Put indeed your blocks $B_ij$ in a $mtimes k$ array and then "read" this array:



                    -- row-wise: any element of $[n]$ appears then $m$ times.



                    -- column-wise: any element of $[n]$ appears then $k$ times.







                    share|cite|improve this answer












                    share|cite|improve this answer



                    share|cite|improve this answer










                    answered 13 hours ago









                    Teo BanicaTeo Banica

                    568528




                    568528











                    • $begingroup$
                      26 seconds slower than Fedor, but my answer is better, does not use multiplication :)
                      $endgroup$
                      – Teo Banica
                      13 hours ago










                    • $begingroup$
                      you actually multiply 1 by $m$ and by $k$ :)
                      $endgroup$
                      – Fedor Petrov
                      13 hours ago
















                    • $begingroup$
                      26 seconds slower than Fedor, but my answer is better, does not use multiplication :)
                      $endgroup$
                      – Teo Banica
                      13 hours ago










                    • $begingroup$
                      you actually multiply 1 by $m$ and by $k$ :)
                      $endgroup$
                      – Fedor Petrov
                      13 hours ago















                    $begingroup$
                    26 seconds slower than Fedor, but my answer is better, does not use multiplication :)
                    $endgroup$
                    – Teo Banica
                    13 hours ago




                    $begingroup$
                    26 seconds slower than Fedor, but my answer is better, does not use multiplication :)
                    $endgroup$
                    – Teo Banica
                    13 hours ago












                    $begingroup$
                    you actually multiply 1 by $m$ and by $k$ :)
                    $endgroup$
                    – Fedor Petrov
                    13 hours ago




                    $begingroup$
                    you actually multiply 1 by $m$ and by $k$ :)
                    $endgroup$
                    – Fedor Petrov
                    13 hours ago

















                    draft saved

                    draft discarded
















































                    Thanks for contributing an answer to MathOverflow!


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




                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function ()
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f327585%2ffamilies-of-ordered-set-partitions-with-disjoint-blocks%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

                    How to make RAID controller rescan devices The 2019 Stack Overflow Developer Survey Results Are InLSI MegaRAID SAS 9261-8i: Disk isn't recognized after replacementHow to monitor the hard disk status behind Dell PERC H710 Raid Controller with CentOS 6?LSI MegaRAID - Recreate missing RAID 1 arrayext. 2-bay USB-Drive with RAID: btrfs RAID vs built-in RAIDInvalid SAS topologyDoes enabling JBOD mode on LSI based controllers affect existing logical disks/arrays?Why is there a shift between the WWN reported from the controller and the Linux system?Optimal RAID 6+0 Setup for 40+ 4TB DisksAccidental SAS cable removal

                    Free operad over a monoid object The 2019 Stack Overflow Developer Survey Results Are InAn interpretation of this construction giving an operad from a bialgebra?What is the free monoidal category generated by a monoid?Unitalization internal to monoidal categoriesCorrespondence between operads and $infty$-operads with one objectCorrespondence between operads and monads requires tensor distribute over coproduct?understanding the definition of $infty$-operad of module objectsReference for “multi-monoidal categories”When is a quasicategory over $N(Delta)^op$ a planar $infty$-operad?An interpretation of this construction giving an operad from a bialgebra?$H$-space structure on coloured algebrasTwo monoidal structures and copowering

                    Србија Садржај Етимологија Географија Историја Политички систем и уставно-правно уређење Становништво Привреда Образовање Култура Спорт Државни празници Галерија Напомене Референце Литература Спољашње везе Мени за навигацију44°48′N 20°28′E / 44.800° СГШ; 20.467° ИГД / 44.800; 20.46744°48′N 20°28′E / 44.800° СГШ; 20.467° ИГД / 44.800; 20.467ууРезултати пописа 2011. према старости и полуу„Положај, рељеф и клима”„Europe: Serbia”„Основни подаци”„Gross domestic product based on purchasing-power-parity (PPP) valuation of country GDP”„Human Development Report 2018 – "Human Development Indices and Indicators 6”„Устав Републике Србије”Правопис српскога језикаGoogle DriveComparative Hungarian Cultural StudiesCalcium and Magnesium in Groundwater: Occurrence and Significance for Human Health„UNSD — Methodology”„Процене становништва | Републички завод за статистику Србије”The Age of Nepotism: Travel Journals and Observations from the Balkans During the Depression„The Serbian Revolution and the Serbian State”„Устав Србије”„Serbia a few steps away from concluding WTO accession negotiations”„A credible enlargement perspective for and enhanced EU engagement with the Western Balkans”„Freedom in the World 2017”„Serbia: On the Way to EU Accession”„Human Development Indices and Indicators: 2018 Statistical Update”„2018 Social Progress Index”„Global Peace Index”Sabres of Two Easts: An Untold History of Muslims in Eastern Europe, Their Friends and Foes„Пројекат Растко—Лузица”„Serbia: Introduction”„Serbia”оригинала„The World Factbook: Serbia”„The World Factbook: Kosovo”„Border Police Department”„Uredba o kontroli prelaska administrativne linije prema Autonomnoj pokrajini Kosovo i Metohija”оригиналаIvana Carevic, Velimir Jovanovic, STRATIGRAPHIC-STRUCTURAL CHARACTERISTICS OF MAČVA BASIN, UDC 911.2:551.7(497.11), pp. 1Archived„About the Carpathians – Carpathian Heritage Society”оригинала„O Srbiji”оригинала„Статистички годишњак Србије, 2009: Географски прегледГеографија за осми разред основне школе„Отворена, електронска база едукационих радова”„Влада Републике Србије: Положај, рељеф и клима”„Копрен (Стара планина)”„Туристичка дестинација-Србија”„Висина водопада”„РХМЗ — Републички Хидрометеоролошки завод Србије Кнеза Вишеслава 66 Београд”„Фауна Србије”„Српске шуме на издисају”„Lepih šest odsto Srbije”„Илустрована историја Срба — Увод”„Винчанска култура - Градска општина Гроцка”„''„Винча — Праисторијска метропола”''”оригиналаЈужни Словени под византијском влашћу (600—1025)Држава маћедонских Словена„Карађорђе истина и мит, Проф. др Радош Љушић, Вечерње новости, фељтон, 18 наставака, 24. август - 10. септембар 2003.”„Политика: Како је утврђена војна неутралност, 13. јануар. 2010, приступљено децембра 2012.”„Србија и РС оживеле Дејтонски споразум”„Са српским пасошем у 104 земље”Војска Србије | О Војсци | Војска Србије — Улога, намена и задациАрхивираноВојска Србије | ОрганизацијаАрхивираноОдлука о изради Стратегије просторног развоја Републике Србије до 2020. годинеЗакон о територијалној организацији Републике СрбијеЗакон о државној управиНајчешће постављана питања.„Смањење броја статистичких региона кроз измене Закона о регионалном развоју”„2011 Human development Report”„Službena upotreba jezika i pisama”„Попис становништва, домаћинстава и станова 2011. године у Републици Србији. Књига 4: Вероисповест, матерњи језик и национална припадност”„Вероисповест, матерњи језик и национална”„Специјална известитељка УН за слободу религије и вероисповести Асма Јахангир, код Заштитника грађана Саше Јанковића”„Закон о државним и другим празницима у Републици Србији”„Веронаука у српским школама”„Serbia – Ancestral Genography Atlas”Бела књига Милошевићеве владавинеоригиналаGross domestic product based on purchasing-power-parity (PPP) per capita GDP БДП 2007—2013Актуелни показатељи — Република Србија„Попис становништва, домаћинстава и станова 2011. године у Републици Србији Књига 7: Економска активност”Zemlje kandidati za članstvo u EU„Putin drops South Stream gas pipeline to EU, courts Turkey”„„Соко — историјат””оригинала„„Рембас — историјат””оригинала„„Лубница — историјат””оригинала„„Штаваљ — Историјат””оригинала„„Боговина — историјат””оригинала„„Јасеновац — историјат””оригинала„„Вршка чука — историјат””оригинала„„Ибарски рудници — историјат””оригинала„Закон о просторном плану Републике Србије од 2010 до 2020”„Кривични законик — Недозвољена изградња нуклеарних постројења, члан 267”„Б92: Srbija uklonila obogaćeni uranijum, 25. октобар 2011”„Коришћење енергије ветра у Србији — природни услови и практична примена”„Енергија ветра”„Србија може да прави струју од сунца, биомасе, воде и ветра”„Моја електрана и друге ветрењаче”„Биомаса, струја без инвестиција”„Auto-karte Srbije”„www.srbija.gov.rs Статистике о Србији”оригинала„Статистика зе месец децембар и 2016. годину”„Turizam u Srbiji”„Univerzitet u Beogradu: Vek i po akademskog znanja”„Vojnomedicinska akademija: 165 godina tradicije i napretka”Никола Гиљен, Соња Јовићевић Јов и Јелена Мандић: Мирослављево јеванђеље; Текст је публикован у ревији „Историја” и настао је као део научно-истраживачког рада Фонда „Принцеза Оливера”„World music асоцијација Србије”оригинала„World music у Србији”оригинала„Pogledajte: Boban Marković svira u redakciji „Blica”!”„Eurovision Song Contest 2007 Final”„Projekat Rastko, Alojz Ujes: Joakim Vujic”„Унеско”„Списак локалитета Светске баштине”„Guča i Egzit zaludeli svet”оригинала„Sabor trubača GUČA”„Interesting facts about Exit”оригинала„FIFA Association Information”„Serbia women win EuroBasket title, gain first Olympics berth”„Odbojkašice ispisale istoriju – Srbija je svetski prvak!”„Сајт Ватерполо савеза Србије, Освојене медаље”„Сајт ФК Црвена звезда, Бари”„Сајт ФК Црвена звезда, Токио”„Blic:Zlatna Milica! Mandićeva donela Srbiji najsjajnije odličje u Londonu!”„Милица Мандић освојила златну медаљу („Политика”, 12. август 2012)”„Златни Давор Штефанек”„DŽUDO ŠAMPIONAT Majdov osvojio svetsko zlato”„Španovićeva trećim skokom svih vremena do zlata!”„Чудо Иване Шпановић — 7,24 м („Политика”, 5. март 2017)”The Age of Nepotism: Travel Journals and Observations from the Balkans During the DepressionCalcium and Magnesium in Groundwater: Occurrence and Significance for Human HealthComparative Hungarian Cultural StudiesБела књига Милошевићеве владавинеоригиналаComparative Hungarian Cultural StudiesSabres of Two Easts: An Untold History of Muslims in Eastern Europe, Their Friends and FoesГеографија за осми разред основне школеSerbia: the country, people, life, customsМедијиВодичПодациВлада Републике СрбијеНародна скупштина Републике СрбијеНародна канцеларија председника Републике СрбијеНародна банка СрбијеТуристичка организација СрбијеПортал еУправе Републике СрбијеРепубличко јавно правобранилаштвоууууууWorldCat151202876n851959190000 0000 9526 67094054598-24101000570825ge130919