Previous Conferences & Workshops

Mar
28
2011

Computer Science/Discrete Mathematics Seminar I

Non-negatively Weighted #CSPs: An Effective Complexity Dichotomy
Xi Chen
11:15am|S-101

We prove a complexity dichotomy theorem for all non-negatively weighted counting Constraint Satisfaction Problems (#CSP). This caps a long series of important results on counting problems including unweighted and weighted graph homomorphisms and the...

Mar
24
2011

Joint IAS/Princeton University Number Theory Seminar

Random Maximal Isotropic Subspaces and Selmer Groups
Bjorn Poonen
4:30pm|S-101

We show that the p-Selmer group of an elliptic curve is naturally the intersection of two maximal isotropic subspaces in an infinite-dimensional locally compact quadratic space over F_p. By modeling this intersection as the intersection of a random...