meta user
network profile
| bio | website | |
|---|---|---|
| location | New York, United States | |
| age | 30 | |
| visits | member for | 2 years, 9 months |
| seen | Mar 31 at 6:25 | |
| stats | profile views | 18 |
|
Sep 17 |
awarded | Commentator |
|
Sep 17 |
comment |
A challenge by R. P. Feynman: give counter-intuitive theorems that can be translated into everyday language I feel the same for Napoleon's theorem en.wikipedia.org/wiki/Napoleon%27s_Theorem |
|
Apr 19 |
awarded | Popular Question |
|
Feb 27 |
awarded | Yearling |
|
Feb 18 |
awarded | Nice Answer |
|
Nov 1 |
answered | How do we show the equality of these two summations? |
|
Feb 2 |
awarded | Nice Question |
|
Nov 2 |
accepted | Number of ways to partition a rectangle into n sub-rectangles |
|
Nov 2 |
comment |
Number of ways to partition a rectangle into n sub-rectangles 1, 2, 6, 15 are exactly the numbers I have when I count by hands (including all rotations and reflections.) I will appreciate if you can share the recurrence relation or point me to a publication. |
|
Aug 8 |
comment |
Number of ways to partition a rectangle into n sub-rectangles Interesting but I wonder if your graph representation will be sufficient. From the second example above, sliding the partitions the other way around from "clockwise" to "counter-clockwise" will result in another way to partition with the exactly same graph. |
|
Aug 5 |
comment |
Number of ways to partition a rectangle into n sub-rectangles @Jens It doesn't matter where exactly the lines are. What matters is the overall form. |
|
Aug 4 |
awarded | Teacher |
|
Jul 30 |
comment |
Watchdog Problem I indeed forgot. Thanks. |
|
Jul 30 |
revised |
Watchdog Problem added 9 characters in body; edited tags; added 2 characters in body |
|
Jul 30 |
comment |
Number of ways to partition a rectangle into n sub-rectangles No, I don't take length into accounts. Frankly I don't know how to rephrase the question to be more mathematically specific. This question is tagged "computer-science" because I am thinking of generating all of these patterns and objectively choosing the "best-looking" ones, and it would be nice to be able to take a look at all of them. If there is a solution, it's good. If not, I want to be sure that it is still a open problem. Then how about good approximation or related problems? |
|
Jul 29 |
awarded | Scholar |
|
Jul 29 |
comment |
Number of ways to partition a rectangle into n sub-rectangles Then should I repost this in MathOverflow? |
|
Jul 29 |
accepted | Watchdog Problem |
|
Jul 29 |
awarded | Supporter |
|
Jul 29 |
comment |
Watchdog Problem True, I guess. So basically this is like placing the dogs equally on 2-unit line segment (back and forth). Do you know any related problems or ideas to generalize this problem? |
