Bounding the degree of solutions to Pfaff equations (Q1595459): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
 
(2 intermediate revisions by one other user not shown)
Property / reviewed by
 
Property / reviewed by: Zbigniew Hajto / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Zbigniew Hajto / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Latest revision as of 06:04, 5 March 2024

scientific article
Language Label Description Also known as
English
Bounding the degree of solutions to Pfaff equations
scientific article

    Statements

    Bounding the degree of solutions to Pfaff equations (English)
    0 references
    0 references
    0 references
    26 July 2001
    0 references
    The authors investigate an old question asked by Poincaré: Given a foliation \(\mathcal F\) of degree \(d\) on an \(n\)-dimensional complex projective space and an \(\mathcal F\) -invariant projective hypersurface \(V\), is it possible to bound the degree of \(V\) by a number depending only on \(d\) and not on \(\mathcal F\) ? This question has been studied by various authors in the context of classical theory of foliations, e.g. by \textit{E. Ballico, M. Brunella, M. M. Carnicer, D. Cerveau} and \textit{A. Lins Neto}. In the present paper the authors work with Pfaff equations which are more general than foliations. Under a natural assumption that the ambient space \(X\) is a complex projective manifold with \(\text{Pic}(X)=\mathbb Z\) they give a positive answer to the above question in the case when \(V\) is a normal crossing hypersurface. At the end of the paper they discuss to which extent the normal crossing hypothesis can be weakened.
    0 references
    Pfaff equation
    0 references
    foliation
    0 references
    Poincaré problem
    0 references
    normal crossing hypersurface
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references