Please use this identifier to cite or link to this item:
https://hdl.handle.net/2445/165518
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Gutiérrez Marín, Javier J. | - |
dc.contributor.author | Perea Navarro, Anna | - |
dc.date.accessioned | 2020-06-15T07:27:58Z | - |
dc.date.available | 2020-06-15T07:27:58Z | - |
dc.date.issued | 2020-01-19 | - |
dc.identifier.uri | https://hdl.handle.net/2445/165518 | - |
dc.description | Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2020, Director: Javier J. Gutiérrez Marín | ca |
dc.description.abstract | [en] Braid theory is a an important tool in low dimensional topology. In this work we study the braid group and see how it relates to knot theory. The main objective is to formulate and prove Alexander’s theorem stating that any knot, or more generally any link, can be obtained as the closure of a braid. We give two constructive proofs, one based on Alexander’s original proof and the other one following the Yamada–Vogel’s algorithm. Moreover, we provide the code of of an implementation of the latter algorithm, written in Python. | ca |
dc.format.extent | 73 p. | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | cat | ca |
dc.rights | cc-by-nc-nd (c) Anna Perea Navarro, 2020 | - |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ | * |
dc.source | Treballs Finals de Grau (TFG) - Matemàtiques | - |
dc.subject.classification | Topologia de baixa dimensió | ca |
dc.subject.classification | Treballs de fi de grau | - |
dc.subject.classification | Teoria de nusos | ca |
dc.subject.classification | Grups infinits | ca |
dc.subject.classification | Python (Llenguatge de programació) | ca |
dc.subject.classification | Algorismes computacionals | ca |
dc.subject.other | Low-dimensional topology | en |
dc.subject.other | Bachelor's theses | - |
dc.subject.other | Knot theory | en |
dc.subject.other | Infinite groups | en |
dc.subject.other | Python (Computer program language) | en |
dc.subject.other | Computer algorithms | en |
dc.title | Grup de trenes i el teorema d’Alexander | ca |
dc.type | info:eu-repo/semantics/bachelorThesis | ca |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | ca |
Appears in Collections: | Treballs Finals de Grau (TFG) - Matemàtiques |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
165518.pdf | Memòria | 2.06 MB | Adobe PDF | View/Open |
This item is licensed under a
Creative Commons License