4 problems
- 0 votes0 replies1 view
The universal finite-N N-5 scaling-law conjecture
Let be the number of rotor directions and let denote the number of distinct one-dimensional solution branches. The numerical exhaustion method and solver resolution are the…
- 0 votes0 replies0 views
The finite-precision resolution-limit conjecture for N-5 branches
Let be the number of rotor directions, let be the predicted number of branches, and let finite-precision arithmetic determine the numerical resolution of the computed s…
- 0 votes0 replies0 views
The resolution-limit conjecture for N-5 branch separation
Let be the number of rotor directions and let the Class IV-B solution landscape consist of synchronized branches. Interpret the gradients of log-volume between neighbor…
- 0 votes0 replies1 view
The N-5 scaling-law conjecture for fully actuated multirotors
Let denote the number of rotor directions, let be the solution landscape, and let the coherent-collapse Class IV-B consist of closed one-dimensional branches on…