This talk is devoted to the "Kac-Rice formula", which is an explicit way to compute
the expected number of zeroes of a random series with independent Gaussian coefficients.
We will discuss the original proofs of Kac and Rice (1940's),
an elegant geometrical proof due to Edelman and Kostlan (1995), some interesting examples,
and extensions to complex zeroes and eigenvalues of random matrices.
Here is a title and abstract for the lunch seminar:
Rigidity sequences for weakly mixing transformations
Abstract: I will present a recent result of Bassam Fayad
and Jean-Paul Thouvenot that shows that any rigidty
sequence for an irrational rotation is also a rigidity
sequence for some weakly mixing transformation.
Let G be an infinite connected graph. For each vertex of G we decide randomly and independently: with probability p we paint it blue and with probability 1-p we paint it yellow. Now, consider the subgraph of blue vertices: does it contain an infinite connected component?
There is a critical probability p_c(G), such that if p>p_c then almost surely there is a blue infinite connected component and if pp_c or p<p_c.
We will focus on planar graphs, specifically on the triangular
Abstract: This talk will describe joint work with Aravind Asok
and Jean Fasel using the methods of homotopy theory to construct new
algebraic vector bundles. I will describe a natural conjecture
true, implies that over the complex numbers the classification
vector bundles over smooth affine varieties admitting an
decomposition coincides with the classification of topological
complex vector bundles.