A Spinorial Formulation of the Maximum Clique Problem of a Graph

Simple item page
dc.creatorBudinich, Marco
dc.creatorBudinich, Paolo
dc.date2006-03-27
dc.date.accessioned2026-07-07T12:59:42Z
dc.date.available2026-07-07T12:59:42Z
dc.descriptionWe present a new formulation of the maximum clique problem of a graph in complex space. We start observing that the adjacency matrix A of a graph can always be written in the form A = B B where B is a complex, symmetric matrix formed by vectors of zero length (null vectors) and the maximum clique problem can be transformed in a geometrical problem for these vectors. This problem, in turn, is translated in spinorial language and we show that each graph uniquely identifies a set of pure spinors, that is vectors of the endomorphism space of Clifford algebras, and the maximum clique problem is formalized in this setting so that, this much studied problem, may take advantage from recent progresses of pure spinor geometry.
dc.identifierhttps://arxiv.org/abs/math-ph/0603068
dc.identifierhttp://arxiv.org/abs/math-ph/0603068
dc.identifierJ. Math. Phys. 47, 043502 (2006)
dc.identifierdoi:10.1063/1.2186256
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/225655
dc.subjectMathematical Physics
dc.subjectDiscrete Mathematics
dc.subjectCombinatorics
dc.titleA Spinorial Formulation of the Maximum Clique Problem of a Graph
dc.typetext

Files

Collections

arXiv