Polynomial foliations of \({\mathbb{R}}^ 2\). (Q5930557): Difference between revisions

From authors' introduction: ``In 1940 \textit{W. Kaplan} published two large papers [Duke Math. J. 7, 154--185 (1940; Zbl 0024.19001; JFM 66.0966.05); Duke Math. J. 8, 11--46 (1941; Zbl 0025.09301; JFM 67.0744.02)] on regular families of curves filling the plane, following previous ideas of \textit{H. Whitney} [Ann. Math. (2) 34, 244--270 (1933; Zbl 0006.37101; JFM 59.1256.04)]. A family of curvers is called regular it is locally homeomorphic with parallel lines. He proved that each curve of a regular family filling the plane is homeomorphic line tending to infinity in both directions. A natural example of generating (orientated) regular families of curves on the plane is given by the solutions of non-singular planar differential systems.\dots We say that two planar differential systems are topologically equivalent if there exists a homeomorphism on the plane which maps the solution curves of one to the solution curves of the other. In the second paper, Kaplan charcterized the topological classes of regular families based on a certain algebraic structure of the orbits which he called chordal system. Ten years later, \textit{L. Markus} [Trans. Am. Math. Soc. 76, 127--148 (1954; Zbl 0055.08102)] considered the topological classification problem for general (with or wihout singular points) differential systems on the plane.\dots He pointed out the existence of some key orbits he called separatrices. It follows from \textit{L. Markus} and \textit{D. A. Neumann} [Proc. Am. Math. Soc. 48, 73--81 (1975; Zbl 0307.34044)] works that two planar differential systems having isolated singular points are topologically equivalent if there exists a homeomorphism sending the separatrix configuration of one system to the separatrix configuration, of the other system. Both, Kaplan and Markus-Neumann theorems, gave a good starting point to obtain all topologically equivalent classes for a given family of planar differential systems.\dots However, it is also clear that a reasonable topologically classification of equivalent, classes for general either planar analytic or planar \(n\) degree polynomial differential systems with singular points cannot be done. Precisely, when polynomial differential systems of degree \(n\) are considered the main difficulties come from the number and distribution of their limit cycles, see the famous Hilbert's sixteenth problem.\dots Hence, a natural framework where can be possible to obtian a topological classification is given by the class of polynomial differential systems of degree \(n\) without singular points. We will refer to this class as planar polynomial foliation of degree \(n\). Here every orbit, which we call a leave of the foliation.\dots Two leaves \(L_1\), and \(L_2\) are said to be inseparable if for any arcs \(T_1\) and \(T_2\) transverses to \(L_1\) and \(L_2\) respectively there are leaves which intersects both \(T_1\) and \(T_2\). Since the orbit behavior inside each canonical region is parallel it follows from Markus-Neumann results that the number of topological classes of polynomial foliations of degree \(n\) depends on the number of inseparable leaves and the way they are distributed on the plane.\dots Clearly the maximum number of inseparable leaves gives a measure of the possible different topological classes of polynomial foliations of degree \(n\).'' If \(s(n)\) denotes the maximum number of inseparable leaves that a planar polynomial foliation of degree \(n\) can have, then authors give a summary with the previously known results: \(s(0)= s(1)= 0\), \(s(2)= s(3)= 3\) and \(s(n)\leq 2n\) if \(n\geq 4\), and \(s(n)\geq 2n- 4\) if \(n\geq 4\) is even. The aim of this paper is ``twofold''. On one hand, the authors give new better lower bounds on the maximum number of inseparable leaves for planar polynomial foliations. More precisely, they find an explicit planar polynomial foliation of degree \(n\) with \(2n- 4\) inseparable leaves. Hence, \(s(n)\geq 2n- 4\) for all \(n\geq 4\). Moreover, the authors improve the general lower bound for \(s(n)\) when \(n= 4\) and \(n= 6\), showing that \(s(4)\geq 6\) and \(s(6)\geq 9\). On the other hand the authors characterize the structurally stable planar polynomial foliations under polynomial perturbations, and study the number of inseparable leaves in this family of planar polynomial foliations. Finally, the authors give examples which realize all possible number of inseparable leaves of structurally stable planar polynomial foliations.