Seminars Sorted by Series

Short Talks by Postdoctoral Members

Oct
04
2005

Short Talks by Postdoctoral Members

Deformed Harish-Chandra Homorphism for the Cyclic Quiver
2:00pm|S-101

The rational degeneration of the double affine Hecke algebras associated to the Weyl group $W$ is a rational Cherednik algebra $H_W$ associated to $W$. Deformed Harish-Chandra homorphism is an analog of the Berstein-Beilinson localization for the...

Oct
04
2005

Short Talks by Postdoctoral Members

Fitting a Smooth Function to Data
4:00pm|S-101

Suppose we are given a finite subset E in an n-dimensional real space, and a real valued function f defined on E. How to extend f to a C^m smooth function F, defined on the entire R^n, with C^m norm of the smallest possible order of magnitude? We...

Oct
05
2005

Short Talks by Postdoctoral Members

Mahler Measure and Values of Regulators
2:00pm|S-101

The Mahler measure of an n-variable polynomial P can be defined as the integral of log|P| over the n-dimensional unit torus T^n with the Haar measure. While the algebraic nature of the values of Mahler measure for the one-variable case is well...

Oct
06
2005

Short Talks by Postdoctoral Members

Strong Approximation on Random Towers of Graphs
4:00pm|S-101

I will explain, in elementary graph theoretic terms, the strong approximation phenomenon in linear groups as it was discovered by Weisfeiler and Nori. It turns out that the strong approximation phenomenon holds also for some random families of...

Sep
29
2006

Short Talks by Postdoctoral Members

Random Band Matrices
2:00pm

I will discuss random band matrices, presenting some interesting conjectures that have appeared in the physics literature and some rigorous results which complete one end of the picture.

Oct
04
2006

Short Talks by Postdoctoral Members

Circuit Lower Bounds and Incomplete Exponential Sums
3:15pm|S-101

In this talk I will consider depth-three circuits having a MAJORITY gate at the output, MODULO(m) gates in the middle, and polylog-degree AND gates at the inputs. It is conjectured that such circuits need exponential size to compute the MODULO(q)...

Oct
11
2006

Short Talks by Postdoctoral Members

The Indentity Testing Problem
4:00pm|S-101

Identity Testing is the following problem: given an arithmetic circuit C with coefficients from some field F, determine if the polynomial computed by the circuit is the identically zero polynomial or not. This problem admits a simple and efficient...