The universal finite-N N-5 scaling-law conjecture

From papers

Let NN be the number of rotor directions and let KK denote the number of distinct one-dimensional solution branches. The numerical exhaustion method and solver resolution are the methods used to isolate these branches. The universal N-5 scaling-law conjecture. While K=N5K=N-5 was definitively observed for N{6,7,8,9,10}N\in\{6,7,8,9,10\}, we conjecture that this law holds for all finite NN. For N>10N>10, failure to strictly isolate KK branches is attributed to the resolution limit of the numerical methods and solver, rather than to a breakdown of the underlying algebraic structure. This extends the observed empirical relation beyond the tested range, but no proof or higher-precision symbolic verification is supplied.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Antonio Franchi, “The N-5 Scaling Law: Topological Dimensionality Reduction in the Optimal Design of Fully-actuated Multirotors”, arXiv:2512.23619 (2026).

Solutions 0

No solutions have been posted yet.