Math

School of Mathematics

Graph Coloring, Biclique Partition, and Communication Complexity

Hao Huang
University of California, Los Angeles; Member, School of Mathematics
September 28, 2012 - 2:30pm

Discrete Fourier Restriction Phenomenon and Associated Dispersive Equations

Yi Hu
University of Illinois at Urbana-Champaign; Member, School of Mathematics
September 28, 2012 - 2:15pm

Periodic Orbits in Hamiltonian Dynamics

Doris Hein
University of California, Santa Cruz; Member, School of Mathematics
September 28, 2012 - 2:00pm

Irregular Automorphic Galois Representations

Wushi Goldring
Universite Paris 13; Member, School of Mathematics
September 27, 2012 - 4:30pm

Galois Representations and Modular Forms of Non-Regular Weight

David Geraghty
Princeton University/Institute for Advanced Study
September 27, 2012 - 4:15pm

Representation Theory of Groups Over Close Local fields

Radhika Ganapathy
Purdue University; Member, School of Mathematics
September 27, 2012 - 4:00pm

Higher Dimensional Syntax

Eric Finster
Ecole Polytechnique Federal de Lausanne; Member, School of Mathematics
September 27, 2012 - 2:30pm

Locally Decodable Codes

Klim Efremenko
Tel-Aviv University; Member, School of Mathematics
September 27, 2012 - 2:15pm

 

A code C is said to be Locally Decodable Code with q queries if it is possible to recover any symbol x_j of a message x by making at most q queries to C(x), such that even if a constant fraction of C(x) is corrupted, the decoding algorithm returns the correct answer with high probability.


The Complexity of Transforming Problem Instances

Andrew Drucker
Massachusetts Institute of Technology; Member, School of Mathematics
September 27, 2012 - 2:00pm

Overview of Univalent Foundations

Vladimir Voevodsky
Institute for Advanced Study
September 27, 2012 - 11:00am

(Continued from September 26, 2012)


Syndicate content