English

A novel count of the spanning trees of a cube

Combinatorics 2019-10-10 v2

Abstract

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

Keywords

Cite

@article{arxiv.1909.12839,
  title  = {A novel count of the spanning trees of a cube},
  author = {Thomas W. Mattman},
  journal= {arXiv preprint arXiv:1909.12839},
  year   = {2019}
}

Comments

ver. 2 Add reference to Baker and Norine; 2 pages