Previous Conferences & Workshops

Although equivariant cohomology originated -- at this Institute -- nearly half a century ago, only much more recently has it become an active area of algebraic geometry. The equivariant cohomology rings of simple algebraic varieties such as...

In part I of this talk, we began a discussion of "simple algorithms" and restricted our attention to the priority algorithm model which models ``greedy-like'' algorithms. In Part II of this talk, we will extend the priority algorithm framework to...

Although equivariant cohomology originated -- at this Institute -- nearly half a century ago, only much more recently has it become an active area of algebraic geometry. The equivariant cohomology rings of simple algebraic varieties such as...

The Internet is an indispensable part of our information society, and yet its basic foundations remain vulnerable to simple attacks, and one area that remains especially susceptible to attack is routing. There have been increasing efforts in the...

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...