Resumen

PINEDA, J.A.; ISASI, E.  y  CAICEDO, M.I.. A conjecture for the algorithmic decomposition of paths over an SU(3) ADE graph. Rev. mex. fis. [online]. 2015, vol.61, n.6, pp.444-449. ISSN 0035-001X.

Through a geometric understanding of the creation, cap, annihilation and cup operators for ADE graphs in SU (3) we propose the first steps towards an algorithm that would allow one to write an arbitrary elementary path as an ordered combination of creation and cap operators acting upon an essential path. We propose a sketch of a proof and use our proposal for some examples for the A₂ and E₅ graphs of the SU (3) family. Attaining this decomposition is an important step in obtaining the path formulation of the quantum Algebra of a modular invariant RCFT.

Palabras llave : Rational conformal field theory; ADE classification; essential paths; SU (3) Temperley-Lieb algebra; Ocenanu cells; quantum groups; graph theory; integrable systems.

        · texto en Inglés     · Inglés ( pdf )