Zeon matrix inverses and the zeon combinatorial Laplacian
GS Staples - Advances in Applied Clifford Algebras, 2021 - Springer
In this paper, inverses of matrices over zeon algebras are discussed and methods of
computation are presented. As motivation the zeon combinatorial Laplacian of a simple finite …
computation are presented. As motivation the zeon combinatorial Laplacian of a simple finite …
[HTML][HTML] The Boolean satisfiability problem in Clifford algebra
M Budinich - Theoretical Computer Science, 2019 - Elsevier
The Boolean SATisfiability Problem in Clifford algebra - ScienceDirect Skip to main contentSkip
to article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full …
to article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full …
Zeon and idem-Clifford formulations of Boolean satisfiability
A Davis, GS Staples - Advances in Applied Clifford Algebras, 2019 - Springer
The Boolean satisfiability problem (SAT) is the problem of determining whether the variables
of a given Boolean formula can be consistently replaced by true or false in such a way that …
of a given Boolean formula can be consistently replaced by true or false in such a way that …
Zeros of zeon polynomials and the zeon quadratic formula
E Haake, GS Staples - Advances in Applied Clifford Algebras, 2019 - Springer
Zeon algebras arise as commutative subalgebras of fermions, and can be constructed as
subalgebras of Clifford algebras of appropriate signature. Their combinatorial properties …
subalgebras of Clifford algebras of appropriate signature. Their combinatorial properties …
Hamiltonian cycle enumeration via fermion-zeon convolution
GS Staples - International Journal of Theoretical Physics, 2017 - Springer
Beginning with a simple graph having finite vertex set V, operators are induced on fermion
and zeon algebras by the action of the graph's adjacency matrix and combinatorial …
and zeon algebras by the action of the graph's adjacency matrix and combinatorial …
Spectrally Simple Zeros of Zeon Polynomials
GS Staples - Advances in Applied Clifford Algebras, 2021 - Springer
Combinatorial properties of zeons have been applied to graph enumeration problems,
graph colorings, routing problems in communication networks, partition-dependent …
graph colorings, routing problems in communication networks, partition-dependent …
Zeon and Idem-Clifford Formulations of Hypergraph Problems
S Ewing, GS Staples - Advances in Applied Clifford Algebras, 2022 - Springer
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 graph, in …
trails, cycles, matchings, cliques, and independent sets. In contrast to an ordinary graph, in …
A Spectral Theorem for Zeon Matrices
GS Staples - arxiv preprint arxiv:2201.09321, 2022 - arxiv.org
In this paper, a spectral theorem for matrices with (complex) zeon entries is established. In
particular, it is shown that when $ A $ is an $ m\times m $ self-adjoint matrix whose …
particular, it is shown that when $ A $ is an $ m\times m $ self-adjoint matrix whose …