Abstract
We study the average number of intersecting points of a given curve with random hyperplanes in an n-dimensional Euclidean space. As noticed by A. Edelman and E. Kostlan, this problem is closely linked to finding the average number of real zeros of random polynomials. They showed that a real polynomial of degree n has on average log n + O(1) real zeros (M. Kac's theorem). This result leads us to the following problem: given a real sequence (α k ) k ∊N, study the average where ρ(fn) is the number of real zeros of fn(X) = α0+α1X+ … + αnXn. We give theoretical results for the Thue—Morse polynomials and numerical evidence for other polvnomials
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have