2000 character limit reached
Enumerative Combinatorics of Simplicial and Cell Complexes: Kirchhoff and Trent Type Theorems
Published 12 Jun 2015 in math.CO | (1506.03881v2)
Abstract: This paper considers three separate matrices associated to graphs and (each dimension of) cell complexes. It relates all the coefficients of their respective characteristic polynomials to the geometric and combinatorial enumeration of three kinds of subobjects. The matrices are: the mesh matrix for integral d-cycles of Trent, the mesh matrix for integral d-boundaries, and the Kirchhoff matrix, i.e., the combinatorial Laplacian, for integral (d-1)-chains. Relations to Reidemeister-Franz torsion are elucidated and relations to the foundational work of R. Lyons and G. Kalai.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.