Conjecture on an optimal nonuniform partition for Pascal matrix recursion
Statement
Let , and let satisfy for each and
Set for each , so that the determine a partition of . Partition-runtime conjecture. There exists a choice of such that the resulting runtime satisfies
The preceding analysis establishes this bound for the uniform partition, while the paper notes that numerical experiments suggest nonuniform partitions may perform better; whether an optimal partition can attain this asymptotic bound remains unresolved.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.