Spectral Properties of the Zeon Combinatorial Laplacian

Abstract

Given a finite simple graph G on m vertices, the zeon combinatorial Laplacian of G is an m× m graph having entries in the complex zeon algebra CZ. It is shown here that if the graph has a unique vertex v of degree k, then the Laplacian has a unique zeon eigenvalue λ whose scalar part is k. Moreover, the canonical expansion of the nilpotent (dual) part of λ counts the cycles based at vertex v in G. With an appropriate generalization of the zeon combinatorial Laplacian of G, all cycles in G are counted by . Moreover when a generalized zeon combinatorial Laplacian can be viewed as a self-adjoint operator on the CZ-module of m-tuples of zeon elements, it can be interpreted as a quantum random variable whose values reveal the cycle structure of the underlying graph.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…