On a trace formula of counting Eulerian cycles
Abstract
We make connections of a counting problem of Eulerian cycles for undirected graphs to homological spectral graph theory, and formulate explicitly a trace formula that identifies the number of Eulerian circuits on an Eulerian graph with the trace sum of certain twisted vertex and edge adjacency matrices of the graph. Moreover, we show that reduction of computation can be achieved by taking into account symmetries related to twisted adjacency matrices induced by spectral antisymmetry and graph automorphisms.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.