Laplacian simplices

DOI10.1016/J.AAM.2019.101976MaRDI QIDQ2300575zbMATH OpenOpenAlexWikidataFDO

Authors Benjamin Braun, Marie E. Meyer

Publication date 27 February 2020

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1706.07085

zbMATH Keywords

Laplacian matrixLaplacian simplex

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial inequalities (05A20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of commutative algebra (05E40) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)

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

Recommendations

• Laplacian simplices associated to digraphs
• Simplicial matrix-tree theorems
• Ehrhart series for connected simple graphs
• Interlacing Ehrhart polynomials of reflexive polytopes
• \(h^\ast\)-vectors, Eulerian polynomials and stable polytopes of graphs

Cites work

• \(h^\ast\)-vectors, Eulerian polynomials and stable polytopes of graphs
• Algebraic properties of edge ideals via combinatorial topology
• Cohen-Macaulay graphs
• Compositions constrained by graph Laplacian minors
• Computing the Continuous Discretely
• Decompositions of Rational Convex Polytopes
• Detecting the integer decomposition property and Ehrhart unimodality in reflexive simplices
• Dual Polyhedra and Mirror Symmetry for Calabi-Yau Hypersurfaces in Toric Varieties
• Dual polytopes of rational convex polytopes
• Ehrhart series and lattice triangulations
• Ehrhart series, unimodality, and integrally closed reflexive polytopes
• Existence of unimodular triangulations -- positive results
• Extremal edge polytopes
• scientific article; zbMATH DE number 3163858 (Why is no real title available?)
• Lectures on Polytopes
• Normal polytopes arising from finite graphs
• Nowhere-harmonic colorings of graphs
• On a conjecture concerning spanning tree invariants and loop systems
• On the equations of the edge cone of a graph and some applications
• Permutohedra, Associahedra, and Beyond
• Reflexive polytopes of higher index and the number 12
• Roots of Ehrhart polynomials arising from graphs
• Simplices for numeral systems
• Special simplices and Gorenstein toric rings.
• Unimodality problems in Ehrhart theory
• Unimodality questions for integrally closed lattice polytopes

Cited in

(4)

• Laplacian simplices associated to digraphs
• Shifted simplicial complexes are Laplacian integral
• Simplexwise Linear Untangling
• Effortless Critical Representation of Laplacian Pyramid

This page was built for publication: Laplacian simplices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2300575)