3 citations · 5 across the 3 of their papers we have counts for
5 papers
Spectral Properties of the Zeon Combinatorial Laplacian
G. Stacey Staples
Given a finite simple graph on vertices, the zeon combinatorial Laplacian of is an graph having entries in the complex zeon algebra $\mathbb{C}\mathfrak…
Zeon and Idem-Clifford Formulations of Hypergraph Problems
Samuel Ewing, G. Stacey Staples
Zeon algebras have proven to be useful for enumerating structures in graphs, such as paths, trails, cycles, matchings, cliques, and independent sets. In contrast to an ordinary gra…
A Spectral Theorem for Zeon Matrices
G. Stacey Staples
In this paper, spectral properties of matrices with (complex) zeon entries are investigated. It is shown that when is an self-adjoint matrix whose characteristic po…
Spectrally Simple Zeros of Zeon Polynomials
G. Stacey Staples
Combinatorial properties of zeons have been applied to graph enumeration problems, graph colorings, routing problems in communication networks, partition-dependent stochastic integ…
Graph-induced operators: Hamiltonian cycle enumeration via fermion-zeon convolution
G. Stacey Staples
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…