For a polynomial differential equation in two variables whose singularities are all non-degenerate — equivalently, a holomorphic foliation of the complex projective plane of degree defined over an effectively computable field — Coutinho (2018) introduced an algorithmic strategy that computes, from Camacho–Sad-type index sums over the 'singular blocks' of the singular set together with the global identities equating the two total index sums to and , systems of linear Diophantine equations whose non-negative integer solutions constrain the degree of any algebraic solution (invariant algebraic curve). When the Diophantine systems have finitely many non-negative integer solutions the strategy yields an effective degree bound, but the method is not guaranteed to succeed, and exactly when it does remains open: no non-degenerate foliation with finitely many algebraic solutions is known for which the strategy fails, no criterion decides whether a failure reflects a rational first integral (as in its Example 5.6) or merely a limitation of the bounding method, and the degree-5 search for the foliation of its Example 5.2 was left computationally unfinished. The problem is to characterize the foliations on which the strategy succeeds — in particular, to prove or refute that failure of the Diophantine systems to bound implies the existence of a rational first integral — and to settle the residual computational regimes, notably the degree-5 case of Example 5.2.
Background
A planar polynomial differential equation can be written as a Pfaffian equation , or as the trajectory system of the polynomial vector field . Homogenizing produces a holomorphic foliation of degree of the complex projective plane — the degree of a foliation is the number of points at which it is tangent to a generic projective line — and its singularities are the common zeros of the homogeneous coefficients of the 1-form defining it. An algebraic solution is an invariant algebraic curve : the polynomial satisfies for some polynomial of degree at most , in which case is called a Darboux polynomial and its cofactor. A singularity is non-degenerate when the linear part of the vector field there has two non-zero eigenvalues; their quotient is the characteristic ratio of the singularity. Non-degenerate singularities may still be dicritical — after blowing the point up (replacing it by the projective line of directions through it), the exceptional divisor, the line that replaces the point, is not invariant under the lifted foliation, so separatrices (invariant analytic curves issuing from the singularity) pass through it in infinitely many directions — and dicritical points are precisely where degree bounds become hard.
This is the setting of the classical Poincaré problem: bound the degrees of the algebraic solutions of a foliation in terms of its degree . The best-known general statement is due to Carnicer: an irreducible invariant curve of degree that meets no dicritical singularity satisfies . Such uniform bounds, however, require hypotheses, and they are often far from sharp; for actually computing all algebraic solutions of a concrete foliation defined over an effective field (a field, such as , whose elements and ring operations can be represented and computed exactly on a machine), one wants an effective and ideally sharp degree bound, so that a finite undetermined-coefficient search — a Gröbner basis computation, the standard exact method for solving systems of polynomial equations — can enumerate all Darboux polynomials.
The local tool that makes sharper bounds possible is the Camacho–Sad index: at a singularity lying on an invariant curve , it is a rational residue computed from the eigenvalue data of the linear part, and the Camacho–Sad theorem states that the sum of these indices over all singularities of on equals the curve's self-intersection number . A companion index (the quotient of the eigenvalues in the transverse direction) sums to , the degree of the restriction to of the foliation's normal bundle (the line bundle of directions transverse to the leaves), which has degree . Writing and for these two total sums, the global identities are and (Theorem 2.6 of Coutinho (2018)). Coutinho (2018) turns these two global identities into an algorithm: after placing in generic -position — a coordinate change after which the singular set decomposes as a disjoint union of 'singular blocks' with square-free, computed by a factorizing Gröbner-basis algorithm that exploits the Shape Lemma (the standard fact that a zero-dimensional radical ideal in generic coordinates admits a Gröbner basis consisting of one univariate polynomial in the last variable together with polynomials of degree one in the others) — Galois conjugacy ties the characteristic ratios of the points of a block together, so the two block-wise index sums are either explicit rational numbers — when no characteristic ratio in the block is a positive rational — or linear forms in non-negative integer parameters attached to the block. Substituting one admissible pair of block sums per block into the two global identities produces pairs of linear Diophantine equations in the unknown curve degree and the block parameters. Whenever these systems have altogether finitely many non-negative integer solutions, the degrees of all algebraic solutions are bounded (and the surviving solutions carry multiplicity information that prunes the subsequent search); the systems are solved by classical linear-Diophantine algorithms after an diagonalization of the associated quadratic form, which factors the symmetric matrix of the form into lower-triangular, diagonal, and transpose factors and separates the variables bounded by the positive-definite diagonal part from those that remain free.
The paper implements the procedure in Axiom over and works out six examples. For the degree-3 foliation of its Example 5.2 the systems force , node-counting constraints (from the classical genus formula for singular plane curves) exclude , and an undetermined-coefficient search finds one irreducible cubic solution, ; whether degree-5 solutions exist was left open, the corresponding coefficient system being too large for a standard Gröbner computation. For (Example 5.6) the systems fail to bound — after diagonalization, the linear equation for involves integer parameters not bounded by the positive-definite part of the quadratic one — and indeed has a rational first integral, exhibited through four quadratic Darboux polynomials whose cofactors satisfy an exact linear relation. Classical Darboux theory provides the relevant dichotomy: a foliation of the plane has infinitely many algebraic solutions exactly when it admits a rational first integral, i.e. a non-constant rational function constant along trajectories, built as a quotient of products of Darboux polynomials. Thus the failure of the method on is 'explained' by genuine integrability; the open question is whether this is the only possible failure mode.
Problem Statement
Let be a foliation of of degree , defined over an effective field (for instance ), all of whose singularities are non-degenerate. Apply the procedure of Coutinho (2018): put in generic -position; decompose its singular set into singular blocks ; compute, for each block, the possible values of the two block-wise index sums — explicit rationals when no characteristic ratio of the block is a positive rational, and linear forms in non-negative integer parameters otherwise; and substitute one admissible pair per block into the global identities and — where and denote the total sums, over all singularities lying on a candidate invariant curve of degree , of the companion index (the eigenvalue quotient in the transverse direction) and the Camacho–Sad index respectively — to obtain systems of linear Diophantine equations in the curve degree and the block parameters. Say the strategy succeeds on when these systems have altogether finitely many non-negative integer solutions, so that the degrees of all algebraic solutions of are effectively bounded.
(1) Characterize the class of non-degenerate foliations on which the strategy succeeds. The central question is to prove or refute that if the strategy fails on — the Diophantine systems admit infinitely many non-negative integer solutions — then has a rational first integral, equivalently infinitely many algebraic solutions. A refutation must exhibit an explicit over an effective field (for instance a number field given by explicit coefficients), with only finitely many algebraic solutions (possibly none), whose systems fail to bound ; no such example is currently known, and settling whether one exists is part of the question.
(2) Settle the residual computational regime that the method leaves open: for the degree-3 foliation of Example 5.2 of Coutinho (2018) — defined there by explicit rational coefficients, with algebraic-solution degrees constrained to , degree excluded, and one irreducible cubic solution known — decide whether degree-5 algebraic solutions exist.
The common objective of (1) and (2) is to convert the index–Diophantine strategy from a heuristic into a method of proven scope: to decide, within the class of non-degenerate foliations over effective fields, exactly when singularity data suffice to bound the degrees of algebraic solutions, and to make the residual cases effectively decidable.
References
- S. C. Coutinho, Bounding the degree of solutions of differential equations, Journal of Symbolic Computation 89 (2018) 9–25. DOI: 10.1016/j.jsc.2017.11.002, https://doi.org/10.1016/j.jsc.2017.11.002
- Cesar Camacho, Paulo Sad, Invariant varieties through singularities of holomorphic vector fields, Annals of Mathematics (2) 115 (1982) 579–595. DOI: 10.2307/2007013, https://doi.org/10.2307/2007013
- Manuel M. Carnicer, The Poincaré Problem in the Nondicritical Case, Annals of Mathematics (2) 140 (1994) 289–294. DOI: 10.2307/2118601, https://doi.org/10.2307/2118601
- S. C. Coutinho, L. Menasché Schechter, Algebraic solutions of holomorphic foliations: an algorithmic approach, Journal of Symbolic Computation 41 (5) (2006) 603–618. DOI: 10.1016/j.jsc.2005.11.002, https://doi.org/10.1016/j.jsc.2005.11.002
- Alin Bostan, Guillaume Chèze, Thomas Cluzeau, Jacques-Arthur Weil, Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields, Mathematics of Computation 85 (299) (2016) 1393–1425. DOI: 10.1090/mcom/3007, https://doi.org/10.1090/mcom/3007
- Khalil Ghorbal, Maxime Bridoux, Automated Reasoning For The Existence Of Darboux Polynomials, Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation (ISSAC 2024) (2024) 324–333. DOI: 10.1145/3666000.3669705, https://doi.org/10.1145/3666000.3669705
- Maxime Bridoux, Khalil Ghorbal, A Mathematica Package for Certifying the Nonexistence of Darboux Polynomials, ACM Communications in Computer Algebra 58 (2) (2024) 31–34. DOI: 10.1145/3712023.3712027, https://doi.org/10.1145/3712023.3712027
- Jinzhi Lei, Lijun Yang, Algebraic Multiplicity and the Poincaré Problem, preprint (2023). arXiv:2309.16392, https://arxiv.org/abs/2309.16392
- João Paulo Figueredo, Wodson Mendson, Non-algebraicity of foliations via reduction modulo 2, preprint (2025). arXiv:2507.07277, https://arxiv.org/abs/2507.07277
- Stefania Vassiliadis, Explicit bounds on foliated surfaces and the Poincaré problem, preprint (2025). arXiv:2511.08388, https://arxiv.org/abs/2511.08388
- S. C. Coutinho, Catching Tangent Curves in Fields of Lines, The American Mathematical Monthly 129 (1) (2022) 52–65. DOI: 10.1080/00029890.2022.1993713, https://doi.org/10.1080/00029890.2022.1993713