A novel count of the spanning trees of a cube
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.