Previous Conferences & Workshops

Feb
10
2016

Mathematical Conversations

Hyperbolicity in dynamics
6:00pm|Dilworth Room

"Hyperbolic" ranks highly among the most-abused terms in dynamics. I'll prolong this abuse, and argue for its value, by illustrating a variety of dynamical systems with distinct forms of hyperbolic behavior that have known or conjectured...

Feb
09
2016

Geometric Structures on 3-manifolds

Obstructions to minimal fibrations of hyperbolic 3-manifolds
2:00pm|S-101

Through the work of Agol and Wise, we know that all closed hyperbolic 3-manifolds are finitely covered by a surface bundle over the circle. Thus the geometry of these bundles indicates the geometry of general hyperbolic 3-manifolds. But there are...

Feb
09
2016

Computer Science/Discrete Mathematics Seminar II

The singularity of symbolic matrices
10:30am|S-101

The main object of study of this talk are matrices whose entries are linear forms in a set of formal variables (over some field). The main problem is determining if a given such matrix is invertible or singular (over the appropriate field of...

Feb
08
2016

Special Analysis/Number Theory Seminar

Variance of sums of arithmetic functions over primes in short intervals
Jon Keating
4:30pm|S-101

Goldston & Montgomery and Montgomery & Soundararajan have established formulae for the variance of sums of the von Magoldt function over short intervals (i.e. for the variance of the number of primes in these intervals) assuming, respectively, the...

Feb
08
2016

Members’ Seminar

The singularity of symbolic matrices
2:00pm|S-101

The main object of study of this talk are matrices whose entries are linear forms in a set of formal variables (over some field). The main problem is determining if a given such matrix is invertible or singular (over the appropriate field of...

Feb
08
2016

Computer Science/Discrete Mathematics Seminar I

Bipartite perfect matching is in quasi-NC
Stephen Fenner
11:15am|S-101

We show that the bipartite perfect matching problem is in $\textrm{quasi-}\textsf{NC}^2$. That is, it has uniform circuits of quasi-polynomial size and $O(\log^2 n)$ depth. Previously, only an exponential upper bound was known on the size of such...

Feb
05
2016

Mathematical Conversations

Computer algebra systems, formal proofs and interactive theorem proving
6:00pm|Dilworth Room

Computer algebra systems are large software systems and as such they have bugs. A recent issue of the Notices of the AMS features the article "The Misfortunes of a Trio of Mathematicians Using Computer Algebra Systems. Can We Trust in Them?" in...

Feb
04
2016

Joint IAS/Princeton University Number Theory Seminar

Cycles on the moduli of Shtukas and Taylor coefficients of L-functions
4:30pm|S-101

This is joint work with Zhiwei Yun. We prove a generalization of Gross-Zagier formula in the function field setting. Our formula relates self-intersection of certain cycles on the moduli of Shtukas for $\mathrm{GL}(2)$ to higher derivatives of L...