Previous Conferences & Workshops

Apr
06
2011

Special Seminar

Infinite Generaton of Non-Cocompact Lattices on Right-Angled Buildings
Anne Thomas
4:00pm|S-101

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

Apr
06
2011

Workshop on Topology: Identifying Order in Complex Systems

Using Computational Algebraic Topology to Characterize Chromosome Instability in Cancer
Javier Arsuaga
3:00pm|University of Pennsylvania, David Rittenhouse Lab., Room A6

DNA copy number abnormalities (CNAs) play an important role in cancer, and are associated with tumor progression as well as clinical outcome. Using microarray based comparative genomic hybridization (CGH), analysis of CNAs across large cohorts of...

Apr
06
2011

Galois Representations and Automorphic Forms Seminar

Automorphic Cohomology II (Carayol's work and an Application)
Phillip Griffiths
2:00pm|S-101

These two talks will be about automorphic cohomology in the non-classical case. By definition, automorphic cohomology are the groups $H^q( \Gamma \backslash D, L)$ where $D$ is a homogeneous complex manifold $G_{\mathbb R}/H$, $G_{\mathbb R}$ is a...

Apr
05
2011

Computer Science/Discrete Mathematics Seminar II

Zero-One Rounding of Singular Vectors
10:30am|S-101

Given a matrix $A$, it can be shown that there is a vector $z \in 0,1^n$ for which $|Az|/|Z| \geq |A|_2/C \log(n)$ (a0/1 sum of columns of $A$ which witnesses its large spectral norm) for instance by discretizing the top singular vector of $A$ and...

Apr
04
2011

Members’ Seminar

Symplectic Dynamics of Integrable Hamiltonian Systems
2:00pm|S-101

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

Apr
04
2011

Computer Science/Discrete Mathematics Seminar I

Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority
Ashwin Nayak
11:15am|S-101

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