A "sparsifier" of a graph is a weighted subgraph for which every
cut has approximately the same value as the original graph, up to a
factor of (1 +/- eps). Sparsifiers were first studied by Benczur
and Karger (1996). They have wide-ranging...
In this lecture, Rohini Somanathan, Leon Levy Foundation Member,
School of Social Science, explores the emergence and the
consequences of the strategy adopted by the Indian state to
equalize opportunity. In the 1950s, the several thousand
castes...
Let Gamma be a non-cocompact lattice on a right-angled building
X. Examples of such X include products of trees, or Bourdon's
building I_{p,q}, which has apartments hyperbolic planes tesselated
by right-angled p-gons and all vertex...
Recursive Majority-of-three (3-Maj) is a deceptively simple
problem in the study of randomized decision tree complexity. The
precise complexity of this problem is unknown, while that of the
similarly defined Recursive NAND tree is completely...
I will start with a review the basic notions of
Hamiltonian/symplectic vector field and of Hamiltonian/symplectic
group action, and the classical structure theorems of Kostant,
Atiyah, Guillemin-Sternberg and Delzant on Hamiltonian torus
actions...
