Previous Conferences & Workshops

Dec
03
2009

Joint IAS/Princeton University Number Theory Seminar

Hilbert Modular Surfaces Through K3 Surfaces
Abhinav Kumar
4:30pm|Fine Hall -- 214

We describe how to use Shioda-Inose structures on K3 surfaces to write down explicit equations for Hilbert modular surfaces, which parametrize principally polarized abelian surfaces with real multiplication by the ring of integers in Q({\sqrt{D})...

Dec
03
2009

Analytic and Geometric Number Theory Seminar

Half-Dimensional Sieve, Multiplicative Functions and Rational Points
2:00pm|S-101

In the first half of the talk I will give details of my joint work with Henryk Iwaniec. We use half-dimensional sieve to obtain a lower bound for the density of rational points on the cubic Chatelet surface. The cubic Chatelet surface can also be...

Dec
02
2009

Workshop on Topology: Identifying Order in Complex Systems

Topological Methods in the Arnold Diffusion Problem
5:00pm|Hill Center, Rutgers, The State University of New Jersey (CoRe 433)

We discuss some geometric and topological methods that are applied to overcome the large gap problem in Arnold diffusion for a priori unstable Hamiltonian systems. The geometric methods rely on the theory of normally hyperbolic invariant manifolds...

Dec
02
2009

Workshop on Topology: Identifying Order in Complex Systems

Knots in Proteins
Alexander Grosberg
3:30pm|Hill Center, Rutgers, The State University of New Jersey (CoRe 433)

Proteins with knots in their native state were discovered few years ago. Analysis of the entire protein data base indicates that there are quite a few proteins with knots, particularly with slip knots, but still the fraction of proteins with knots...

Dec
02
2009

Workshop on Topology: Identifying Order in Complex Systems

Electrical and Systems Engineering
Daniel Koditschek
2:00pm|Hill Center, Rutgers, The State University of New Jersey (CoRe 433)

My collaborators and I have spent a the better part of two decades seeking to develop formally and apply empirically methods of programming work: that is, we want to know how to say what we mean, yet mean what we say to a machine built for...

Dec
01
2009

Computer Science/Discrete Mathematics Seminar II

Algorithmic Dense Model Theorems, Decompositions, and Regularity Theorems
10:30am|S-101

Green and Tao used the existence of a dense subset indistinguishable from the primes under certain tests from a certain class to prove the existence of arbitrarily long prime arithmetic progressions. Reingold, Trevisan, Tulsiani and Vadhan, and...

Nov
30
2009

Members’ Seminar

Moduli Spaces of Bundles -- With Some Twists
2:00pm|S-101

Semisimple Lie groups seem to be very rigid objects. In arithmetic situations the fact that a semisimple group may degenerate into a non-semisimple one in a family is well known. In geometric situations this phenomenon has not been applied that much...