Skip to main content
Login | Suomeksi | På svenska | In English

Combinatorial Symmetries in Knot Theory : Yamada Polynomials from Transfer-Matrix Methods

Show simple item record

dc.date.accessioned 2022-01-26T08:22:40Z
dc.date.available 2022-01-26T08:22:40Z
dc.date.issued 2022-01-26
dc.identifier.uri http://hdl.handle.net/123456789/39314
dc.title Combinatorial Symmetries in Knot Theory : Yamada Polynomials from Transfer-Matrix Methods en
ethesis.faculty Matemaattis-luonnontieteellinen tiedekunta fi
ethesis.faculty Faculty of Science en
ethesis.faculty Matematisk-naturvetenskapliga fakulteten sv
ethesis.faculty.URI http://data.hulib.helsinki.fi/id/8d59209f-6614-4edd-9744-1ebdaf1d13ca
ethesis.university.URI http://data.hulib.helsinki.fi/id/50ae46d8-7ba9-4821-877c-c994c78b0d97
ethesis.university Helsingin yliopisto fi
ethesis.university University of Helsinki en
ethesis.university Helsingfors universitet sv
dct.creator Lundström, Teemu
dct.issued 2022 xx
dct.abstract Spatial graphs are graphs that are embedded in three-dimensional space. The study of such graphs is closely related to knot theory, but it is also motivated by practical applications, such as the linking of DNA and the study of chemical compounds. The Yamada polynomial is one of the most commonly used invariants of spatial graphs as it gives a lot of information about how the graphs sit in the space. However, computing the polynomial from a given graph can be computationally demanding. In this thesis, we study the Yamada polynomial of symmetrical spatial graphs. In addition to being symmetrical, the graphs we study have a layer-like structure which allows for certain transfer-matrix methods to be applied. There the idea is to express the polynomial of a graph with n layers in terms of graphs with n − 1 layers. This then allows one to obtain the polynomial of the original graph by computing powers of the so-called transfer-matrix. We introduce the Yamada polynomial and prove various properties related to it. We study two families of graphs and compute their Yamada polynomials. In addition to this, we introduce a new notational technique which allows one to ignore the crossings of certain spatial graphs and turn them into normal plane graphs with labelled edges. We prove various results related to this notation and show how it can be used to obtain the Yamada polynomial of these kinds of graphs. We also give a sketch of an algorithm with which one could, at least in principle, obtain the Yamada polynomials of larger families of graphs. en
dct.subject Graph Theory
dct.subject Spatial Graphs
dct.subject Knot Theory
dct.subject Yamada Polynomial
dct.subject Transfer-Matrix Methods
ethesis.isPublicationLicenseAccepted true
ethesis.language.URI http://data.hulib.helsinki.fi/id/languages/eng
ethesis.language englanti fi
ethesis.language English en
ethesis.language engelska sv
ethesis.thesistype pro gradu -tutkielmat fi
ethesis.thesistype master's thesis en
ethesis.thesistype pro gradu-avhandlingar sv
ethesis.thesistype.URI http://data.hulib.helsinki.fi/id/thesistypes/mastersthesis
dct.identifier.ethesis E-thesisID:60244ebf-abf7-4407-9f63-389f12f2bce5
dct.identifier.urn URN:NBN:fi:hulib-202201261117
dct.alternative Kombinatoriset Symmetriat Solmuteoriassa : Yamada-polynomit matriisimetodien avulla fi
ethesis.facultystudyline Matematiikka fi
ethesis.facultystudyline Mathematics en
ethesis.facultystudyline Matematik sv
ethesis.facultystudyline.URI http://data.hulib.helsinki.fi/id/SH50_050
ethesis.mastersdegreeprogram Matematiikan ja tilastotieteen maisteriohjelma fi
ethesis.mastersdegreeprogram Master 's Programme in Mathematics and Statistics en
ethesis.mastersdegreeprogram Magisterprogrammet i matematik och statistik sv
ethesis.mastersdegreeprogram.URI http://data.hulib.helsinki.fi/id/MH50_001

Files in this item

Files Size Format View
Lundstrom_Teemu ... sferMatrixMethods_2022.pdf 7.068Mb PDF

This item appears in the following Collection(s)

Show simple item record