Rank of ordinary webs in codimension one. An effective method
Abstract
We are interested by holomorphic d-webs W of codimension one in a complex n-dimensional manifold M. If they are ordinary, i.e. if they satisfy to some condition of genericity (whose precise definition is recalled), we proved in [CL] that their rank (W) is upper-bounded by a certain number π'(n,d)\ (which, for n≥ 3, is stictly smaller than the Castelnuovo-Chern's bound π(n,d)). In fact, denoting by c(n,h) the dimension of the space of homogeneous polynomials of degree h with n unknowns, and by h0 the integer such that c(n,h0-1)<d≤ c(n,h0), π'(n,d) is just the first number of a decreasing sequence of positive integers π'(n,d)=h0-2≥ h0-1≥ ·s≥ h≥ h+1≥·s≥ ∞=(W)≥ 0 becoming stationary equal to (W) after a finite number of steps. This sequence is an interesting invariant of the web, refining the data of the only rank. The method is effective : theoretically, we can compute h for any given h ; and, as soon as two consecutive such numbers are equal (h=h+1, \ h≥ h0-2), we can construct a holomorphic vector bundle Rh M of rank h, equipped with a tautological holomorphic connection ∇h whose curvature Kh vanishes iff the above sequence is stationary from there. Thus, we may stop the process at the first step where the curvature vanishes. Examples will be given.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.