How many limit cycles can a planar polynomial vector field have when only the number of monomials is fixed, with the degree left arbitrary? Gasull and Santana introduced the Hilbert monomial number — the supremum of the number of limit cycles over all planar polynomial vector fields whose two components contain altogether exactly monomials — and proved quadratic-in- lower bounds, but no upper bound of any kind is known, and it is open whether is finite. The problem asks for (a) finiteness or a nontrivial upper bound for as a function of (or an explicit fixed-monomial family with unboundedly many limit cycles proving infinitude), (b) sharper small- values, in particular a 5- or 6-monomial field with more than 12 limit cycles or a proof of optimality, and (c) the source's Newton-polygon variation: a bound on the number of distinct periodic annuli of a Hamiltonian polynomial field in terms of the interior lattice points of its Newton polygon. As of 2026, no published work resolves any of the three components.
Background
The second part of Hilbert's 16th problem asks for the maximum number of limit cycles — isolated periodic orbits of the flow — of a planar polynomial vector field of a given degree, together with their possible configurations. Writing for the family of planar polynomial fields with and for the number of limit cycles of (the value being admitted), the Hilbert number is . No upper bound on is known for any — it is not even known whether is finite — while the best lower bounds grow at least on the order of (Christopher and Lloyd 1995; Han and Li 2012), and specific examples give , (Li, Liu and Yang 2009) and (Prohens and Torregrosa 2019).
Gasull and Santana (2024) proposed a sparsity-based variant, motivated by Descartes' rule of signs: a univariate polynomial with nonzero monomials has at most positive real roots regardless of its degree. Let be the family of planar polynomial vector fields whose two components together contain exactly nonzero monomials, with no restriction on the degree, and define the Hilbert monomial number . The real setting is essential: in complex coordinates with a polynomial with monomials, one and two monomials allow at most 0 and 1 limit cycles, but three monomials already allow unboundedly many (Gasull, Li and Torregrosa 2015), so no monomial-count bound can hold in the complex setting. In the real setting, Buzzi, Carvalho and Gasull (2021) proved for and for . Gasull and Santana (2024) proved for , via Abelian integrals (integrals of polynomial one-forms over the closed ovals of a Hamiltonian level set, whose zeros control limit cycles bifurcating from them), and the small- bounds for , , , , ; the bound incorporates the computer-assisted proof of Bréhard, Brisebarre, Joldes and Tucker (2024) that a quartic field with nine monomials has at least 24 limit cycles. The values are the example propagated by persistence of odd-multiplicity cycles, and the authors state they believe these bounds could be improved but were unable to do so. Crucially, the paper establishes no upper bound of any kind: finiteness of is open even for , despite containing fields of arbitrarily high degree.
The same paper's closing section, crediting its referees, proposes a geometric companion question. For a polynomial, its Newton polygon is the convex hull, in the exponent plane , of the exponent vectors of its monomials ; for a polynomial vector field , denotes the convex hull of the union of the exponent vectors occurring in the two components and . In real algebraic geometry, the classical Harnack bound on the number of connected components of a real algebraic plane curve admits a sparse analogue depending only on the number of integer lattice points in the interior of the Newton polygon. A Hamiltonian vector field has the level curves of the polynomial as trajectories; around a center — an equilibrium surrounded only by periodic orbits — its periodic orbits fill a period annulus, a maximal open annulus foliated by periodic orbits. For a Hamiltonian field, differentiation shifts each exponent vector of by in and by in , so is determined by the support of up to these bounded shifts; this suggests transferring the sparse algebraic-geometry bound to dynamics: bounding the number of distinct periodic annuli of in terms of the number of interior lattice points of . No result in either direction is known.
Problem Statement
Determine to what extent discrete sparsity data of a planar polynomial vector field controls its periodic-orbit structure. The problem comprises three linked targets that jointly serve this one objective.
(a) Monomial Hilbert number. With the family of planar polynomial vector fields whose two components together contain exactly nonzero monomials (degree arbitrary) and , where is the number of limit cycles (isolated periodic orbits) of : determine whether is finite for each fixed — in particular for . Either establish a nontrivial upper bound, i.e. an explicit function with for all ; or prove that is finite for some fixed (in particular for ); or prove that for some finite by exhibiting a family of vector fields with a fixed number of monomials and unboundedly many limit cycles. Each of these three alternatives resolves (a).
(b) Small- sharpness. Construct an explicit planar polynomial vector field with exactly 5 or exactly 6 monomials and more than 12 limit cycles, or prove that or (the current lower bounds, obtained by persistence from the 4-monomial example, are believed improvable by the source authors, who state they could not improve them).
(c) Newton-polygon annuli bound. For a Hamiltonian planar polynomial vector field with Newton polygon , prove or refute the existence of a bound, depending only on the number of integer lattice points in the interior of , on the number of distinct periodic annuli of . Refutation may take the form of an explicit sequence of Hamiltonian fields whose Newton polygons have a fixed number of interior lattice points while the number of distinct periodic annuli grows without bound.
The three targets share one scientific objective — a Descartes-type theory bounding the number of limit cycles and periodic annuli of planar polynomial fields by combinatorial data of their monomial support. The source presents (a) as the central open question of its variant (its own theorems are lower bounds only), (b) as an explicitly identified improvable direction, and (c) as a variation suggested by the paper's referees. The three targets are independent: resolving any one of (a), (b), (c) is a partial resolution of the problem, and resolving all three resolves it.
References
- Armengol Gasull, Paulo Santana, On a variant of Hilbert's 16th problem, Nonlinearity 37 (2024), no. 12, 125012. DOI: 10.1088/1361-6544/ad8c1b; arXiv:2405.04281; https://arxiv.org/abs/2405.04281
- Claudio A. Buzzi, Yagor Romano Carvalho, Armengol Gasull, Limit cycles for some families of smooth and non-smooth planar systems, Nonlinear Analysis 207 (2021) 112298. DOI: 10.1016/j.na.2021.112298; arXiv:2008.07692; https://arxiv.org/abs/2008.07692
- Armengol Gasull, Some open problems in low dimensional dynamical systems, SeMA Journal 78 (2021) 233–269. DOI: 10.1007/s40324-021-00244-3; arXiv:2012.02524; https://arxiv.org/abs/2012.02524
- A. Gasull, C. Li, J. Torregrosa, Limit cycles for 3-monomial differential equations, Journal of Mathematical Analysis and Applications 428 (2015) 735–749. DOI: 10.1016/j.jmaa.2015.03.039; https://doi.org/10.1016/j.jmaa.2015.03.039
- M. Han, J. Li, Lower bounds for the Hilbert number of polynomial systems, Journal of Differential Equations 252 (2012) 3278–3304. DOI: 10.1016/j.jde.2011.11.024; https://doi.org/10.1016/j.jde.2011.11.024
- Colin Christopher, Nigel G. Lloyd, Polynomial systems: a lower bound for the Hilbert numbers, Proceedings of the Royal Society of London Series A 450 (1995) 219–224. DOI: 10.1098/rspa.1995.0081; https://doi.org/10.1098/rspa.1995.0081
- C. Li, C. Liu, J. Yang, A cubic system with thirteen limit cycles, Journal of Differential Equations 246 (2009) 3609–3619. DOI: 10.1016/j.jde.2009.01.038; https://doi.org/10.1016/j.jde.2009.01.038
- R. Prohens, J. Torregrosa, New lower bounds for the Hilbert numbers using reversible centers, Nonlinearity 32 (2019) 331–355. DOI: 10.1088/1361-6544/aae94d; https://doi.org/10.1088/1361-6544/aae94d
- F. Bréhard, N. Brisebarre, M. Joldes, W. Tucker, Efficient and Validated Numerical Evaluation of Abelian Integrals, ACM Transactions on Mathematical Software 50 (2024) 1–38. DOI: 10.1145/3637550; https://doi.org/10.1145/3637550
- Jianfeng Huang, Renhao Tian, Yulin Zhao, A Chebyshev criterion for at most two non-zero limit cycles in Abel equations, Nonlinearity 39 (2026) 015030. DOI: 10.1088/1361-6544/ae3b8f; arXiv:2506.14091; https://arxiv.org/abs/2506.14091
- L. Q. Arakaki, D. Novaes, Strict increase in the number of normally hyperbolic limit tori in 3D polynomial vector fields, preprint (2025). arXiv:2504.13832; https://arxiv.org/abs/2504.13832
- M. J. Álvarez, B. Coll, A. Gasull, R. Prohens, More limit cycles for complex differential equations with three monomials, Journal of Differential Equations 416 (2025) 1071–1098. DOI: 10.1016/j.jde.2024.10.013; https://doi.org/10.1016/j.jde.2024.10.013
- Armengol Gasull, Paulo Santana, A note on Hilbert 16th problem, Proceedings of the American Mathematical Society 153 (2025) 669–677. DOI: 10.1090/proc/17116; arXiv:2407.13465; https://arxiv.org/abs/2407.13465