Papers
Topics
Authors
Recent
Search
2000 character limit reached

Genera of non-algebraic leaves of polynomial foliations of $\mathbb C^2$

Published 29 Jul 2014 in math.CV and math.DS | (1407.7878v4)

Abstract: In this article, we prove two results. First, we construct a dense subset in the space of polynomial foliations of degree $n$ such that each foliation from this subset has a leaf with at least $\frac{(n+1)(n+2)}2-4$ handles. Next, we prove that for a generic foliation invariant under the map $(x, y)\mapsto (x, -y)$ all leaves have infinitely many handles.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.