Newton's problem of minimal resistance asks for the convex body of given base and height that experiences the least drag when moving through a rarefied medium; analytically, one minimizes the functional over concave functions . The nose-stretching method of Plakhov (2021), refined in Plakhov (2022a), shows that every minimizer is the closed convex hull of its singular boundary points — points where the supporting plane is not unique — so the problem reduces entirely to understanding the singular set. Two linked questions remain open. (A) Plakhov's conjecture that the singular set of a minimizer is closed, and therefore nowhere dense: currently not even non-denseness is known, so the regular part of the boundary could in principle degenerate entirely. (B) For the unit circular base, the rigorous classification of minimizers across the height parameter : numerical studies indicate a sequence of bifurcation values with a unique minimizer (up to rotation) whose top level set is a regular -gon for and two minimizers at , but no rigorous classification, exact values, or uniqueness theorem exists — and the explicit candidate solutions proposed in the literature have been refuted by the theorem that boundary conical parts destroy optimality. The problem is to prove or disprove (A) and (B).
Background
Newton's problem of minimal resistance, first formulated by Isaac Newton in 1685 (see the historical accounts in Buttazzo–Kawohl 1993 and Buttazzo 2025), asks for the shape of a convex body of given base and height that experiences the least drag when it moves at constant velocity through a rarefied medium of non-interacting particles that rebound elastically, each particle meeting the body at most once. Writing the front surface of the body as the graph of a concave function , where is a compact convex base with nonempty interior and is the height, the drag is proportional to the resistance functional
and the problem is to minimize over all concave with on . The concavity constraint (equivalently, convexity of the body lying below the graph) is what makes the problem nonstandard: it is a pointwise second-order constraint, minimizers are not smooth, and no classical Euler–Lagrange regularity theory applies to them.
Associate with the convex body . A boundary point of is called singular if it admits more than one supporting plane, and regular otherwise. A point of is extreme if it is not a convex combination of two distinct other points of . Singular points split into conical points (the tangent cone, i.e. the smallest convex cone with apex at the point that contains the body, is three-dimensional) and ridge points (the tangent cone degenerates into a dihedral angle). A surface patch with identically zero Gaussian curvature is called developable; it is swept out by straight lines. Almost every boundary point of a convex body is regular, and by the Krein–Milman theorem a compact convex body is the convex hull of its extreme points.
What is known about minimizers: existence holds (Buttazzo–Ferone–Kawohl 1995); wherever exists, either or ; the top level set is neither empty nor a singleton; on any open set where a minimizer is (away from the levels and ) one has , so smooth patches of the boundary are developable and contain no extreme points (Brock–Ferone–Kawohl 1996) — in particular, minimizers on a disk are not rotationally symmetric, a symmetry-breaking phenomenon; and when the boundary curve of is regular (for example a circle), every minimizer satisfies on (Plakhov 2020).
Plakhov (2021) introduced a geometric perturbation technique, the method of nose stretching, and proved that at least one minimizer satisfies : the optimal body is the convex hull of the closure of its own singular boundary points, so the boundary is swept by line segments whose endpoints lie in the closure of the singular set. This was strengthened by Plakhov (2022a) to every minimizer: each minimizer is uniquely determined by the singular set of its epigraph, and any open patch of the graph on which a minimizer is contains no extreme points. Consequently all information about a solution is carried by its singular set, and the structure of that set is the central object of the theory. Numerical studies (Lachand-Robert–Oudet 2005, convex-hull method; Wachsmuth 2014; Wachsmuth 2025) indicate that minimizers on the unit disk have dihedral symmetry, polygonal top level sets whose number of sides depends on the height , and lateral boundaries foliated by line segments joining singular curves. However, the explicit candidate bodies proposed in the literature were refuted: Lokutsievskiy–Wachsmuth–Zelikin (2022) proved that any conical part of the boundary destroys optimality, which rules out the conjectured solutions of Lachand-Robert–Peletier (2001) for every and the structural conjecture of Wachsmuth (2014) at . What remains unknown is precisely what this problem asks about: the topological nature of the singular set of a minimizer, and a rigorous classification of minimizers as the height parameter varies.
Problem Statement
Let be a compact convex set with nonempty interior and let . Newton's problem of minimal resistance (concave case) is to minimize
over concave . Write and let denote the set of singular points of (boundary points with more than one supporting plane). Minimizers exist, every minimizer is the closed convex hull of its singular points, and patches of a minimizer's graph contain no extreme points (an extreme point of is a point that is not a convex combination of two distinct other points of ); what remains open is the characterization of the singular sets themselves, and through them of the minimizers. The target, left open by Plakhov (2021) and restated as open in Plakhov (2022a) and Buttazzo (2025), has two linked components:
(A) Singular-set conjecture. Prove or disprove that the set of singular points of a minimizer is closed, and therefore nowhere dense — in the formulation of Plakhov (2021), is a closed subset of (in the relative topology) for a minimizer ; in the formulation of Plakhov (2022a), the set of points of at which a minimizer fails to be differentiable is a closed nowhere dense subset of . It is currently not even known that the singular set of a minimizer is not dense in the graph.
(B) Classification across the height parameter, for the classical circular base . Prove or disprove the taxonomy indicated by numerical computation (Lachand-Robert–Oudet 2005; Wachsmuth 2014; Wachsmuth 2025): there exist bifurcation values such that (i) for , , the minimizer is unique up to rotation about the -axis and its top level set is a regular -gon; (ii) for there are two distinct minimizers up to rotation, with top level sets a regular -gon and a regular -gon respectively.
Components (A) and (B) share one scientific objective: the characterization of optimal bodies through their singular sets, which the nose-stretching theory shows to be equivalent to characterizing the minimizers themselves — (A) is the topological regularity of those sets, (B) their classification as the height varies. The problem is resolved by proving the claims, by refuting them (for instance, by exhibiting a minimizer whose singular set is not closed or is dense in its graph, or a height value at which uniqueness or the polygonal structure of the top level set fails), or by a combination of proof for one component and valid refutation of the other.
References
- A. Plakhov, Method of nose stretching in Newton's problem of minimal resistance, Nonlinearity 34(7), 4716–4743 (2021). DOI: 10.1088/1361-6544/abf5c0, https://doi.org/10.1088/1361-6544/abf5c0 (arXiv:2003.06682)
- A. Plakhov, A solution to Newton's least resistance problem is uniquely defined by its singular set, Calculus of Variations and Partial Differential Equations 61(5), 189 (2022a). DOI: 10.1007/s00526-022-02300-w, https://doi.org/10.1007/s00526-022-02300-w (arXiv:2109.14207)
- A. Plakhov, On the Structure of Singular Points of a Solution to Newton's Least Resistance Problem, Journal of Dynamical and Control Systems 29(4), 1161–1174 (2022b). DOI: 10.1007/s10883-022-09616-y, https://doi.org/10.1007/s10883-022-09616-y (arXiv:2203.14235)
- L. Lokutsievskiy, G. Wachsmuth, M. Zelikin, Non-optimality of conical parts for Newton's problem of minimal resistance in the class of convex bodies and the limiting case of infinite height, Calculus of Variations and Partial Differential Equations 61(1), 31 (2022). DOI: 10.1007/s00526-021-02118-y, https://doi.org/10.1007/s00526-021-02118-y (arXiv:2009.12128)
- G. Buttazzo, The problem of minimal resistance, old and new (2025). arXiv:2511.01041, https://arxiv.org/abs/2511.01041
- G. Wachsmuth, New numerical solutions to Newton's problem of least resistance via a convex hull approach (2025). arXiv:2511.09177, https://arxiv.org/abs/2511.09177
- F. Brock, V. Ferone, B. Kawohl, A symmetry problem in the calculus of variations, Calculus of Variations and Partial Differential Equations 4(6), 593–599 (1996). DOI: 10.1007/BF01261764, https://doi.org/10.1007/BF01261764
- G. Buttazzo, V. Ferone, B. Kawohl, Minimum problems over sets of concave functions and related questions, Mathematische Nachrichten 173(1), 71–89 (1995). DOI: 10.1002/mana.19951730106, https://doi.org/10.1002/mana.19951730106
- G. Buttazzo, B. Kawohl, On Newton's problem of minimal resistance, The Mathematical Intelligencer 15(4), 7–12 (1993). DOI: 10.1007/BF03024318, https://doi.org/10.1007/BF03024318
- T. Lachand-Robert, É. Oudet, Minimizing within Convex Bodies Using a Convex Hull Method, SIAM Journal on Optimization 16(2), 368–379 (2005). DOI: 10.1137/040608039, https://doi.org/10.1137/040608039
- G. Wachsmuth, The numerical solution of Newton's problem of least resistance, Mathematical Programming 147(1–2), 331–350 (2014). DOI: 10.1007/s10107-014-0756-2, https://doi.org/10.1007/s10107-014-0756-2
- A. Plakhov, A note on Newton's problem of minimal resistance for convex bodies, Calculus of Variations and Partial Differential Equations 59(5), 167 (2020). DOI: 10.1007/s00526-020-01833-2, https://doi.org/10.1007/s00526-020-01833-2 (arXiv:1908.01042)
- T. Lachand-Robert, M. A. Peletier, Newton's Problem of the Body of Minimal Resistance in the Class of Convex Developable Functions, Mathematische Nachrichten 226(1), 153–176 (2001). DOI: 10.1002/1522-2616(200106)226:1<153::AID-MANA153>3.0.CO;2-2, https://doi.org/10.1002/1522-2616(200106)226:1%3C153::AID-MANA153%3E3.0.CO;2-2