2012
DOI: 10.24033/asens.2169
|View full text |Cite
|
Sign up to set email alerts
|

Monodromy and topological classification of germs of holomorphic foliations

Abstract: We give a complete topological classification of germs of holomorphic foliations in the plane under rather generic conditions. The key point is the introduction of a new topological invariant called monodromy representation. This monodromy contains all the relevant dynamical information, in particular the projective holonomy representation whose topological invariance was conjectured in the eighties by Cerveau and Sad and proved here under mild hypotheses.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

1
38
0
1

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 16 publications
(40 citation statements)
references
References 14 publications
1
38
0
1
Order By: Relevance
“…Because the dicriticity of a irreducible component D can be characterized by the vanishing of the Camacho-Sad indices along all the adjacent components at their intersection points with D, we have: Proof of Theorem 11.4. This result extends Theorem 5.0.2 of [15] and we will sketch an inductive proof similar to that described in Chapter 8 of [15]. We proceed in four steps: first we extend to our new context the notion of monodromy; then we construct a conjugation Φ 1 between F ♯ and G ♯ on a neighborhood of the union of all non exceptional cut-components of E F ; in a third step we define a conjugation Φ 2 along the exceptional cut-component except at the nodal singularities; finally in the fourth and last step we extend and glue Φ 1 and Φ 2 at the nodal singularities and along the dicritical components.…”
Section: Appendixsupporting
confidence: 83%
See 3 more Smart Citations
“…Because the dicriticity of a irreducible component D can be characterized by the vanishing of the Camacho-Sad indices along all the adjacent components at their intersection points with D, we have: Proof of Theorem 11.4. This result extends Theorem 5.0.2 of [15] and we will sketch an inductive proof similar to that described in Chapter 8 of [15]. We proceed in four steps: first we extend to our new context the notion of monodromy; then we construct a conjugation Φ 1 between F ♯ and G ♯ on a neighborhood of the union of all non exceptional cut-components of E F ; in a third step we define a conjugation Φ 2 along the exceptional cut-component except at the nodal singularities; finally in the fourth and last step we extend and glue Φ 1 and Φ 2 at the nodal singularities and along the dicritical components.…”
Section: Appendixsupporting
confidence: 83%
“…(16). With this identification and thanks to the isomorphisms (14), (15) and (17) it can be easily checked, using the proof of Lemma 3.7, that the map δ = ⊕ α δ α given by the connecting maps δ α of the Mayer-Vietoris exact sequences (18) is the surjective morphism δ :…”
mentioning
confidence: 87%
See 2 more Smart Citations
“…A key step in the proof of this theorem is to establish a correspondence, after resolution, between the singularities of F and F. When a singularity p in the resolution of F is not a corner, we can use the separatrix issuing from p to define the corresponding singularityp in the resolution of F. Moreover, By Zariski's Theorem [6], the singularities p andp are in "isomorphic positions" in their corresponding exceptional divisors. If the singularity p is a corner, we have no separatrix issuing from p and this is the main difficulty when we deal with corner singularities -recall that F is not necessarily of Generic General Type, so the techniques of [4] does not work -. However, if the corner singularity p is a node, we can overcome this difficulty by using a nodal separator issuing from p and Theorem 3 to define the singularityp corresponding to p in the resolution of F. Moreover, Theorem 2 guarantees that p andp are in "isomorphic positions" in their corresponding exceptional divisors.…”
Section: Introductionmentioning
confidence: 99%