Previous Conferences & Workshops

It has been known for a long time that varieties of general type are the most complicated algebraic varieties. It is only recently, however, that the correct definition of the "simplest" algebraic varieties was established. These are the rationally...

Algorithms based on convex optimization, especially linear and semidefinite programming, are ubiquitous in Computer Science. While there are polynomial time algorithms known to solve such problems, quite often the running time of these algorithms is...

By definition, NK_0(R) is K_0(R[t]) modulo K_0(R). We give a formula for this group when R is of finite type over a field of characteristic zero. The group is bigraded and determined by its typical pieces, which are the cdh cohomology groups H^p(R...

If A is a subset of a free group with at least two non-Commuting elements, then |AAA| must be almost quadratic in |A|.

We say a problem is tractable on average if it can be solved on a "good" fraction of instances by an efficient algorithm. To make this definition precise, we need to make two choices: First, what is a "good" fraction of instances - is it 1%, 51%, 99...

p-adic height pairings are analogues of the real height pairings that show up for example in the Birch-Swinnerton Dyer conjectures on special values of L-functions of Abelian varieties. The p-adic pairings show up when one tries to formulate p-adic...

Geisser gives conjectured formulas for special values of zeta-functions of varieties over finite fields in terms of Euler characteristics of arithmetic cohomology (an improved version of Weil-etale cohomology). He then proves these formulas under...