A new arXiv preprint investigates proportional cake cutting under an equal-length constraint. In this setting, each of n agents must receive a bundle of length exactly 1/n, and that bundle must be worth at least 1/n to the agent. The constraint makes the problem more restrictive than standard proportional division.

The paper's main contribution is an exact determination of the worst-case number of cuts needed for any number of agents. This resolves the complexity of the problem in the worst case, providing a precise bound rather than an asymptotic or approximate result.

Because the source is a single abstract, there are no conflicting findings to compare. The result is presented as a definitive answer for this variant of cake cutting.