Previous Conferences & Workshops

Apr
14
2014

Computer Science/Discrete Mathematics Seminar I

Local Correctability of Expander Codes
Brett Hemenway
11:15am|S-101

An error-correcting code is called locally decodable if there exists a decoding algorithm that can recover any symbol of the message with high probability by reading only a small number of symbols of the corrupted codeword. There is a fundamental...

Apr
10
2014

Joint IAS/Princeton University Number Theory Seminar

Applications of additive combinatorics to Diophantine equations
4:30pm|S-101

The work of Green, Tao and Ziegler can be used to prove existence and approximation properties for rational solutions of the Diophantine equations that describe representations of a product of norm forms by a product of linear polynomials. One can...

Apr
09
2014

Mathematical Conversations

On characters and words in groups
6:00pm|Dilworth Room

In 1896, Frobenius obtained a remarkable character-theoretic formula for the number of solutions to the equation \(xyx^{-1}y^{-1}=g\), for any finite group \(G\) and element \(g \in G\). While more than a century has since passed, our understanding...

Apr
09
2014

Goncharov Reading Group

More on motives
Chuck Weibel
10:00am|S-114

The Goncharov reading group is an informal seminar which will read the paper "Volumes of hyperbolic manifolds and mixed Tate motives" and related materials. We will meet on Wednesdays at 10 am in Simonyi 114.

Apr
08
2014

Special Number Theory Seminar

L-functions, sieves and the Tate Shafarevich group
3:30pm|Fine 1201, Princeton University

I will explain joint work with Kannan Soundararajan, where we find an "L-function analogue" of the Brun-Hooley sieve. Essentially, our method allows us to work analytically with long truncated Euler products inside the critical strip. As a...

Apr
08
2014

Computer Science/Discrete Mathematics Seminar II

Do NP-Hard Problems Require Exponential Time?
10:30am|S-101

The P != NP conjecture doesn't tell us what runtime is needed to solve NP-hard problems like 3-SAT and Hamiltonian Path. While some clever algorithms are known, they all require exponential time, and some researchers suspect that this is unavoidable...

Apr
07
2014

Members’ Seminar

Extracting rational vector spaces from torsion groups
2:00pm|S-101

It is well known that a finitely generated torsion abelian group A is finite, and thus carries no `rational' information. However, if the torsion group A is not finitely generated, then there exist meaningful ways to extract rational information out...

Apr
07
2014

Computer Science/Discrete Mathematics Seminar I

Progress on algorithmic versions of the Lovasz Local Lemma
11:15am|S-101

There has been substantial progress on algorithmic versions and generalizations of the Lovasz Local Lemma recently, with some of the main ideas getting simplified as well. I will survey some of the main ideas of Moser & Tardos, Pegden, and David...

Apr
04
2014

Joint IAS/Princeton University Symplectic Geometry Seminar

Minimal Discrepancy of Isolated Singularities and Reeb Orbits
2:30pm|S-101

Let A be an affine variety inside a complex N dimensional vector space which either has an isolated singularity at the origin or is smooth at the origin. The intersection of A with a very small sphere turns out to be a contact manifold called the...