English

Laplacian Simplices

Combinatorics 2017-06-23 v1 Commutative Algebra

Abstract

This paper initiates the study of the "Laplacian simplex" TGT_G obtained from a finite graph GG by taking the convex hull of the columns of the Laplacian matrix for GG. Basic properties of these simplices are established, and then a systematic investigation of TGT_G 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 hh^*-vectors. We prove that if GG is a tree, odd cycle, complete graph, or a whiskering of an even cycle, then TGT_G is reflexive. We show that while TKnT_{K_n} has the integer decomposition property, TCnT_{C_n} for odd cycles does not. The Ehrhart hh^*-vectors of TGT_G for trees, odd cycles, and complete graphs are shown to be unimodal. As a special case it is shown that when nn is an odd prime, the Ehrhart hh^*-vector of TCnT_{C_n} is given by (h0,,hn1)=(1,,1,n2n+1,1,,1)(h_0^*,\ldots,h_{n-1}^*)=(1,\ldots,1,n^2-n+1,1,\ldots, 1). We also provide a combinatorial interpretation of the Ehrhart hh^*-vector for TKnT_{K_n}.

Keywords

Cite

@article{arxiv.1706.07085,
  title  = {Laplacian Simplices},
  author = {Benjamin Braun and Marie Meyer},
  journal= {arXiv preprint arXiv:1706.07085},
  year   = {2017}
}
R2 v1 2026-06-22T20:25:44.830Z