Timeline for Decomposing square of side length $n$ into $n$ squares in a certain "maximal" way
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 23, 2021 at 23:31 | history | edited | RobPratt | CC BY-SA 4.0 |
deleted 6 characters in body
|
| Feb 22, 2021 at 22:54 | comment | added | Marcel K. Goh | Hi, I just saw the table you added. Thanks, this is really cool! | |
| Feb 22, 2021 at 19:32 | history | edited | RobPratt | CC BY-SA 4.0 |
added 3243 characters in body
|
| Feb 21, 2021 at 2:47 | comment | added | RobPratt | @MarcelK.Goh I added my integer linear programming formulation. | |
| Feb 21, 2021 at 2:42 | history | edited | RobPratt | CC BY-SA 4.0 |
added 578 characters in body
|
| Feb 21, 2021 at 2:31 | comment | added | Marcel K. Goh | If I may ask, what was your procedure for finding a decomposition? | |
| Feb 21, 2021 at 2:24 | comment | added | Marcel K. Goh | Whoa! I guess shifting every square left and down as soon as they are generated cannot be done without loss of generality. Thanks for this! | |
| Feb 21, 2021 at 2:20 | history | answered | RobPratt | CC BY-SA 4.0 |