|
Fundamentalnaya i Prikladnaya Matematika, 2006, Volume 12, Issue 4, Pages 53–64
(Mi fpm969)
|
|
|
|
Theorem on the density of separatrix connections for polynomial foliations in $\mathbb CP^2$
D. S. Volk M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Abstract:
In this paper, we prove that in the space of polynomial foliations of a fixed degree of the complex two-dimensional space, foliations with separatrix connection, i.e., foliations in which any two distinct point have a common separatrix, are dense. The main tool of the proof is the analysis of the monodromy group of the foliation in a neighborhood of the infinitely distant point of the ambient projective space.
Citation:
D. S. Volk, “Theorem on the density of separatrix connections for polynomial foliations in $\mathbb CP^2$”, Fundam. Prikl. Mat., 12:4 (2006), 53–64; J. Math. Sci., 150:5 (2008), 2326–2334
Linking options:
https://www.mathnet.ru/eng/fpm969 https://www.mathnet.ru/eng/fpm/v12/i4/p53
|
|