2005-2006 seminars

Apr
18
2006

Lie Groups, Representations and Discrete Mathematics

Actions of Product Groups on Manifolds
Alex Furman
2:00pm|S-101

We analyze volume-preserving actions of product groups on Riemannian manifolds. Under a natural spectral irreducibility assumption, we prove the following dichotomy: Either the action is measurably isometric, in which case there are at most two...

Apr
18
2006

Computer Science/Discrete Mathematics Seminar II

Black Boxes, Inc.
10:30am|S-101

I will survey a number of settings withing theoretical computer sceince in which certain computations are abstracted by "black boxes", namely devices for which we can observe the input-output behavior, but not the actual "guts" of the computation. I...

Apr
17
2006

Computer Science/Discrete Mathematics Seminar I

Simultaneous Optimization and Fairness
Ashish Goel
11:15am|S-101

In this talk, we will sketch the theory of simultaneous optimization for concave profit functions, and point out connections to fairness. More precisely, suppose we would like to simultaneously approximate all symmetric utility functions over a...

Apr
11
2006

Computer Science/Discrete Mathematics Seminar II

New Techniques in Online Game Playing
Elad Hazan
10:30am|S-101

We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret functions, universal portfolio management, online convex optimization and...

Apr
04
2006

Lie Groups, Representations and Discrete Mathematics

Isospectrality and Commensurability
2:00pm|S-101

In previous work we showed that arithmetic hyperbolic 2-manifolds that are isospectral are commensurable. In this talk we discuss the proof of the generalization to dimension 3. We had previously shown that if arithmetic hyperbolic 3-manifolds are...

Apr
04
2006

Computer Science/Discrete Mathematics Seminar II

Periodic Orbits and Extractors
10:30am|S-101

We consider periodic orbits of multiparameter diagonalizable actions. A simple example of such an action is the action generated by the maps x -> 2x mod 1 and x -> 3x mod 1 on R/Z. There are strong parallels between the study of these orbits and...

Apr
03
2006

Computer Science/Discrete Mathematics Seminar I

The Arrangement Method for Linear Programming
Vladlen Koltun
11:15am|S-101

We propose a new approach to designing a strongly polynomial algorithm for linear programming. We show that linear programming on any polytope can be reduced to linear programming on an arrangement polytope. The graphs of arrangement polytopes have...