Timeline for 3-partition of a special set
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 24, 2022 at 15:39 | comment | added | RobPratt | Are you sure it is possible? One idea is to introduce a binary variable for each $(t,p)$ to indicate whether $t$ is uncovered in part $p$ and then minimize the sum of these binary variables. So far, the smallest sum I can find is $56$. | |
| Nov 24, 2022 at 15:11 | comment | added | 4869 | Thank you! I focused on the problem recently and used lingo to give an integer linear programming when I consider the 3-partition of 𝑆7 with 𝑇7 for 7-length sequences. However, the program ran for a long time without any results. Can you give the situation or suggestion at 7 so that I can try to give a general conclusion? | |
| Aug 7, 2022 at 15:47 | vote | accept | 4869 | ||
| Jul 17, 2022 at 17:07 | history | answered | RobPratt | CC BY-SA 4.0 |