Video Lectures

GALOIS REPRESENTATIONS AND AUTOMORPHIC FORMS SEMINAR

We shall recall the spectral terms from the trace formula for G and its stabilaization, as well as corresponding terms from the twisted trace formula for GL(N). We shall then discuss aspects of...

GALOIS REPRESENTATIONS AND AUTOMORPHIC FORMS SEMINAR

Suppose that G is a connected, quasisplit, orthogonal or symplectic group over a field F of characteristic 0. We shall describe a classification of the irreducible representations of G(F) if F is...

Decompositions in theorems in classical Fourier analysis which decompose a function into large Fourier coefficients and a part that is pseudorandom
with respect to (has small correlation with) linear functions. The Goldreich-Levin theorem [GL89]...

A k-modal probability distribution over the domain {1,...,N} is one whose histogram has at most k "peaks" and "valleys". Such distributions are a natural generalization of the well-studied class of monotone increasing (or monotone decreasing)...

In math, one often studies random aspects of deterministic systems and structures. In CS, one often tries to efficiently create structures and systems with specific random-like properties. Recent work has shown many connections between these...

Inspired by the theory of good lattice points in numerical integration, Zaremba conjectured in 1972 that for every denominator q, there is some coprime numerator p, such that the continued fraction expansion of p/q has uniformly bounded quotients...

A Monotone Expander is an expander graph which can be decomposed into a union of a constant number of monotone matchings, under some fixed ordering of the vertices. A matching is monotone if every two edges (u,v) and (u',v') in it satisfy u u' -...

This talk will focus on the complexity of the cubic-residue (and higher-residue) characters over GF(2^n) , in the context of both arithmetic circuits and polynomials.

We show that no subexponential-size, constant-depth arithmetic circuit over...