Nima Hoda (McGill University)

Title: Constructing bisimplices.

Abstract:

I will motivate and describe the construction of an infinite family of cells called bisimplices. The 1-skeleta of these cells are complete bipartite graphs, making them well suited to the construction of higher skeleta of bipartite graphs. The construction of bisimplices poses special challenges since, unlike simplices and cubes, they cannot be realized as polyhedra. An essential component of the construction is an application of the discrete Morse theory of Forman to the recognition of spheres.