##### Department of Mathematics,

University of California San Diego

****************************

### Math 269 - Combinatorics

## Deborah Oliveros

#### UNAM

## Tverberg-type theorems and intersection patterns

##### Abstract:

Tverberg's Theorem says that a set with sufficiently many points in $\mathbb{R}^d$ can always be partitioned into $m$ parts so that the $(m-1)$-simplex is the (nerve) intersection pattern of the convex hulls of the parts. In this talk we will talk about intersection patterns and how Tverberg's Theorem is but a special case of a more general situation where other simplicial complexes arise as nerves.

Host: Brendon Rhoades

### May 1, 2019

### 3:00 PM

### AP&M 7321

****************************