Past Events

The study of certain error terms arising in number theory can lead to very interesting results. For example, it was a great surprise when Littlewood discovered in 1914 that pi(x)-Li(x) changes sign infinitely often. Since then, finer questions have...

An orientable manifold is called amphicheiral if it admits an orientation-reversing self-map and chiral if it does not. Many familiar manifolds like spheres or orientable surfaces are amphicheiral but chiral manifolds have also been known for many...

We look at the problem of recovering a graph from its chromatic symmetric function. For any graph we show that some basic data can be recovered, and for special cases of trees and unicyclic graphs we can recover the graph completely.

Numerical methods for the solution of multibody, frictional contact problems are in demand in a wide variety of application areas that include structural engineering, robotics, computer animation, interactive medical simulation, biomechanics, and...

The torus-equivariant K-theory of a (generalized) flag variety G/P is an algebra over a Laurent polynomial ring. This algebra has a natural basis consisting of structure sheaves of Schubert varieties. The structure constants for multiplication with...

A class of novel deferred correction methods, integral deferred correction (IDC) methods [2], is studied. This class of methods is an extension of ideas introduced by Dutt, Greengard and Rokhlin [1] on spectral deferred correction (SDC) methods for...

For any positive integer n and any space X, Sub{n}(X) denotes the space of all finite subsets of X of cardinality at most n. This is almost like a configuration space but not quite. It appears in various contexts in algebraic and differential...

Formation of endocytic vesicles is a complex, dynamic process that couples sequential protein recruitment and lipid modifications with dramatic shape transformations of the plasma membrane. How the proper timing and coordination of these events is...

The so called "Moore Bound" is one of the great puzzles of graph theory. It is an upper bound on the girth of a d-regular graph on n vertices; it is almost immediate, and appeared in publication roughly 50 years ago. However, this bound has only been...