Spinorial formulations of graph problems
DOI10.1007/S00006-011-0298-0zbMATH Open1266.15036OpenAlexW2095129445MaRDI QIDQ430733FDOQ430733
Authors: Glenn M. Harris, G. Stacey Staples 
Publication date: 26 June 2012
Published in: Advances in Applied Clifford Algebras (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00006-011-0298-0
Recommendations
graphsfinite graphquantum probabilitycyclesClifford algebramatchingsspinorscliquesFock subspacespinor polynomialsspinor space
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Paths and cycles (05C38) Clifford algebras, spinors (15A66)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cohomology in the pure spinor formalism for the superstring
- Clifford algebras and spinors.
- On computational complexity of Clifford algebra
- A new adjacency matrix for finite graphs
- Nilpotent adjacency matrices and random graphs.
- A spinorial formulation of the maximum clique problem of a graph
- Spinor approach to the rotation and reflection groups
- Nilpotent adjacency matrices, random graphs and quantum random variables
Cited In (6)
- Hamiltonian cycle enumeration via fermion-zeon convolution
- Kravchuk matrices and induced operators on Clifford algebras
- Clifford algebras, random graphs, and quantum random variables
- Zeons, orthozeons, and graph colorings
- Laplace and Dirac operators on graphs
- Zeon and idem-Clifford formulations of Boolean satisfiability
This page was built for publication: Spinorial formulations of graph problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q430733)
