Graph-induced operators: Hamiltonian cycle enumeration via fermion-zeon convolution

TL;DR

This paper introduces a novel fermion-zeon convolution method that leverages algebraic operators induced by graph matrices to efficiently enumerate Hamiltonian cycles in arbitrary graphs.

Contribution

It develops a new algebraic convolution approach combining fermion and zeon operators to count Hamiltonian cycles, extending classical determinant and permanent formulas.

Findings

Successfully recovers the number of Hamiltonian cycles in various graphs.

Connects algebraic operator properties with classical graph enumeration theorems.

Provides a new algebraic framework for graph cycle enumeration.

Abstract

Operators are induced on fermion and zeon algebras by the action of adjacency matrices and combinatorial Laplacians on the vector spaces spanned by the graph's vertices. Properties of the algebras automatically give information about the graph's spanning trees and vertex coverings by cycles \& matchings. Combining the properties of operators induced on fermions and zeons gives a fermion-zeon convolution that recovers the number of Hamiltonian cycles in an arbitrary graph. The mathematics underlying the graph-theoretic interpretation of these operators is provided by Kirchhoff's theorem and by the seminal works of Goulden and Jackson and Liu, who established formulas for enumeration of Hamiltonian cycles and paths using determinants and permanents of adjacency matrices.