A linear matrix is a matrix whose entries are linear forms in some indeterminates $t_1,\dots, t_m$ with coefficients in some field $F$. The commutative rank of a linear matrix is obtained by interpreting it as a matrix with entries in the function field $F(t_1,\dots,t_m)$, and is directly related to the central PIT (polynomial identity testing) problem. The
Randomness dispersers are an important tool in the theory of pseudorandomness, with numerous applications. In this talk, we will consider one-bit strong dispersers and show their connection to erasure list-decodable codes and Ramsey graphs.
Princeton University Press will spearhead a discussion with others in the publishing realm on the current and future state of academic publishing.
Dilworth Room, Simons Hall 12-2:00 p.m.
Suggested Audience: IAS Members and Visitors and partners/spouses
Lunch will be provided. To register, click HERE.
We prove that the systole (or more generally, any k-th
homology systole) of a minimal surface in an ambient three manifold of
positive Ricci curvature tends to zero as the genus of the minimal
surfaces becomes unbounded. This is joint work with Anna Siffert.
We shall present a procedure which to any admissible family
of surfaces into an arbitrary closed riemannian manifolds assigns a
smooth, possibly branched, minimal surface
whose area is equal to the width of the corresponding minmax and whose
Morse index is bounded by the
dimension of the familly. We will discuss the question of bounding the
Morse index + Nullity from below as well as possible extensions of
this procedure to more general families.