Previous Conferences & Workshops

Thanks to the Weil conjectures (proved by Deligne) we know that counting points of varieties over finite fields yields topological information about them. In this talk I will describe such a calculation for certain character varieties...

We will describe some bounds on the multidegrees of complete intersections to have trivial Chow groups in low dimensions.

Let $X\subset \P^N$ be a projective submanifold of dimension $n$ in the complex projective space $\P^N$. Let $U$ be a domain in the parameter space $T$ of complete intersections of codimension $m$ and of a given bidegree $(d_1,\dots,d_m)$ in $\P^N$...

The "Design and Analysis of Algorithms" or "Introduction to Algorithms" is a basic undergraduate course in CS. In such courses, the organizational theme is often in terms of "basic algorithmic paradigms" such as greedy algorithms, dynamic...

Lecture 4. The Ax conjecture and degenerations. Originating with his studies on the logic of finite fields, James Ax conjectured that every PAC field is $C_1$. The recent proof of this in characteristic 0 is connected with degenerations of...

A fundamental problem in combinatorial optimization is the edge-disjoint paths problem (EDP). We are given a network and a collection of source-destination pairs in the network. The goal is to maximize the number of pairs that can be connected by...

A well known theorem of Duke states that the collection of all closed geodesics of a given discriminant on SL(2,Z) \ H becomes equidistributed as the discriminant goes to infinity and can be proved using subconvex estimates for L-functions...

Hermann Weyl Lecture