Timeline for Minimum number of elements in all sets
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 8 at 15:14 | comment | added | Julio Di Egidio | Other variations on the problem are possible, just overall I am inclined to think that a clean solution here can be hoped for only if the problem is stated more stringently. | |
| Nov 8 at 15:14 | comment | added | Julio Di Egidio |
If we impose the additional constraint that all L book titles get bought, this becomes the problem of partitioning a set of size L into a collection of K subsets each of size M such that every two subsets share exactly N elements: and the solution space becomes quite simpler. -- This can be obtained in my code by changing the second clause of pairwise__loop_1 to pairwise__loop_1(_, _, Bs0, [], Bs0)..
|
|
| Nov 8 at 15:13 | comment | added | Julio Di Egidio | In its generality this does not in fact seem to be one of the combinatorial designs mentioned by Wikipedia. | |
| Nov 7 at 8:49 | history | edited | Julio Di Egidio | CC BY-SA 4.0 |
slightly amended
|
| Nov 7 at 8:19 | history | edited | Julio Di Egidio | CC BY-SA 4.0 |
slightly improved
|
| Nov 5 at 12:09 | comment | added | Julio Di Egidio | That was some three full days of work already: I don't regret it, but I am not sure if I should keep going, is there any interest? In particular, are we maybe getting to some specific and useful "combinatorial design"? | |
| Nov 4 at 19:52 | history | answered | Julio Di Egidio | CC BY-SA 4.0 |