Speaker:  Tefjol Pllaha, U Kentucky

Title:   Laplacian Simplices II: A Coding Theoretic Approach

Abstract:

This talk will be about Laplacian simplices, that is, simplices whose vertices are rows of the Laplacian matrix of a simple connected graph. We will focus on graphs and graph operations that yield reflexive Laplacian simplices. We spot such graphs by showing that the $h^*$-vector of the simplex is symmetric. We use the same approach as Batyrev and Hofscheier by considering the fundamental parallelepiped lattice points as a finite abelian group. This is joint work with Marie Meyer.

www.math.uky.edu/~readdy/Seminar