(Reply) [entries|reading|network|archive]

[ userinfo | dreamwidth userinfo ]
[ archive | journal archive ]

[personal profile] simont Wed 2014-02-19 13:38
Have you yet found an example where the (apparent) optimal solution requires dividing any stick into more than three pieces?

No, but I haven't looked at any especially large examples, and that's where I'd most expect to see large dissections. I was rather hoping to find a sensible search algorithm and then run it on lots of pairs to collect data for a conjecture, but so far I haven't thought of a good criterion for the search algorithm figuring out when it can be sure all subsequent solutions it finds will be worse.

Is there any good reason not to consider wlog m<n?

None at all – the problem is certainly symmetric in m,n.
Link Read Comments
Anonymous( )Anonymous This account has disabled anonymous posting.
OpenID( )OpenID You can comment on this post while signed in with an account from many other sites, once you have confirmed your email address. Sign in using OpenID.
Account name:
If you don't have an account you can create one now.
HTML doesn't work in the subject.


Notice: This account is set to log the IP addresses of everyone who comments.
Links will be displayed as unclickable URLs to help prevent spam.