Laplacian Simplices
Abstract
This paper initiates the study of the "Laplacian simplex" obtained from a finite graph by taking the convex hull of the columns of the Laplacian matrix for . Basic properties of these simplices are established, and then a systematic investigation of for trees, cycles, and complete graphs is provided. Motivated by a conjecture of Hibi and Ohsugi, our investigation focuses on reflexivity, the integer decomposition property, and unimodality of Ehrhart -vectors. We prove that if is a tree, odd cycle, complete graph, or a whiskering of an even cycle, then is reflexive. We show that while has the integer decomposition property, for odd cycles does not. The Ehrhart -vectors of for trees, odd cycles, and complete graphs are shown to be unimodal. As a special case it is shown that when is an odd prime, the Ehrhart -vector of is given by . We also provide a combinatorial interpretation of the Ehrhart -vector for .
Cite
@article{arxiv.1706.07085,
title = {Laplacian Simplices},
author = {Benjamin Braun and Marie Meyer},
journal= {arXiv preprint arXiv:1706.07085},
year = {2017}
}