2017
Dec
04

# Combinatorics Seminar: Anna Gundert

11:00am to 12:30pm

## Location:

Room 130 IIAS

Title:

The Theta Number of Simplicial Complexes

Abstract:

The celebrated Lovász theta number of a graph is an efficiently computable upper bound for the independence number of a graph, given by a semidefinite program. This talk presents a generalization of the theta number to simplicial complexes of arbitrary dimension, based on real simplicial cohomology theory, in particular higher dimensional Laplacians.

The Theta Number of Simplicial Complexes

Abstract:

The celebrated Lovász theta number of a graph is an efficiently computable upper bound for the independence number of a graph, given by a semidefinite program. This talk presents a generalization of the theta number to simplicial complexes of arbitrary dimension, based on real simplicial cohomology theory, in particular higher dimensional Laplacians.