We introduce a probabilistic framework for the study of real and complex enumerative geometry of lines on hypersurfaces. This can be considered as a further step in the original Shub–Smale program of studying the real zeros of random polynomial systems. Our technique is general, and it also applies, for example, to the case of the enumerative geometry of flats on complete intersections. We derive a formula expressing the average number En of real lines on a random hypersurface of degree 2 n- 3 in RP n in terms of the expected modulus of the determinant of a special random matrix. In the case n= 3 we prove that the average number of real lines on a random cubic surface in RP 3 equals: E3=62-3.This technique can also be applied to express the number Cn of complex lines on a generic hypersurface of degree 2 n- 3 in CP n in terms of the expectation of the square of the modulus of the determinant of a random Hermitian matrix. As a special case, we recover the classical statement C3= 27. We determine, at the logarithmic scale, the asymptotic of the quantity En, by relating it to Cn (whose asymptotic has been recently computed in [19]). Specifically we prove that: limn→∞logEnlogCn=12.Finally we show that this approach can be used to compute the number Rn= (2 n- 3) ! ! of real lines, counted with their intrinsic signs (as defined in [28]), on a generic real hypersurface of degree 2 n- 3 in RP n.
