Smale's sixth problem for five bodies in the plane, with a proof formalized in Lean
Every choice of five positive masses gives finitely many planar central configurations, up to similarity.
Every choice of five positive masses gives finitely many planar central configurations, up to similarity.
Laderman's algorithm uses the fewest multiplications among all bilinear algorithms over F2.
A web server that predicts operons in prokaryotic genomes with a deep-learning model.
Raises the proved lower bound for 13 inputs from 43 to 44 comparators.
Three-dimensional U(1) lattice gauge theory with the Wilson action confines static charges at every coupling.
For any four positive masses and any cyclic ordering of the bodies there is exactly one strictly convex central configuration with that ordering, up to similarity.
Finiteness for six bodies in the plane at generic masses, outside a proper algebraic subset of the mass space.
The Lean 4 and Mathlib formalization of the five-body theorem, checked by the kernel and by two independent kernels.
The number of four-body central configurations for all masses outside a closed null set: always even, between 32 and 50.
Explicit complex solution sets at three special mass vectors, one of which carries a continuum of complex solutions. Finiteness at these masses follows without counting.
A lightweight MobileNetV2-based model that identifies plant pests and diseases, optimized to run on Android.