A novel count of the spanning trees of a cube

TL;DR

This paper provides a concise proof for counting the number of spanning trees in an n-dimensional cube using the Artin-Ihara L-function evaluated at u=1.

Contribution

It introduces a novel approach leveraging the Artin-Ihara L-function to count spanning trees in hypercubes, simplifying previous methods.

Findings

Derived a new formula for spanning trees in n-cubes

Connected number of spanning trees to Artin-Ihara L-function

Simplified proof technique for counting spanning trees

Abstract

Using the special value at $u=1$ of the Artin-Ihara $L$-function, we give a short proof of the count of the number of spanning trees in the $n$-cube.