Fusion Rules in Logarithmic Superconformal Minimal Models

dc.contributor.authorCanagasabey, Michael Nishan
dc.date.accessioned2017-01-03T00:52:58Z
dc.date.available2017-01-03T00:52:58Z
dc.date.issued2016
dc.description.abstractLogarithmic conformal field theory is a relatively recent branch of mathematical physics which gives rise to interesting representations of symmetry algebras through the process of fusion. Fusion is fundamental to the study of conformal field theories and mathematically may be considered to be something of an abstract tensor product of representations. This has been made more precise through an algorithmic approach developed by Nahm, Gaberdiel and Kausch and coded by several research groups. Such an algorithm has been implemented for the case of Virasoro algebra but not in the super-symmetric case. In this thesis we delve into the details of modifying and applying the NGK algorithm for the N=1 super Virasoro algebra and study the representations that arise in both the Neveu-Schwarz and Ramond sector. The algorithm has been encoded in the SAGE programming environment.en_AU
dc.identifier.otherb4371612x
dc.identifier.urihttp://hdl.handle.net/1885/111460
dc.language.isoenen_AU
dc.subjectLogarithimic Conformal Field Theoryen_AU
dc.titleFusion Rules in Logarithmic Superconformal Minimal Modelsen_AU
dc.typeThesis (PhD)en_AU
dcterms.valid2016en_AU
local.contributor.affiliationMathematical Sciences Institute, College of Physical and Mathematical Sciences, The Australian National Universityen_AU
local.contributor.supervisorRidout, David
local.description.notesauthor deposited 3/01/2017en_AU
local.identifier.doi10.25911/5d763399506d8
local.mintdoimint
local.type.degreeDoctor of Philosophy (PhD)en_AU

Downloads

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Canagasabey Thesis 2016.pdf
Size:
834.61 KB
Format:
Adobe Portable Document Format
Description:

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
884 B
Format:
Item-specific license agreed upon to submission
Description: