dc.contributor.advisor | Šťovíček, Jan | |
dc.creator | Trunkát, Marek | |
dc.date.accessioned | 2017-05-16T23:56:59Z | |
dc.date.available | 2017-05-16T23:56:59Z | |
dc.date.issued | 2013 | |
dc.identifier.uri | http://hdl.handle.net/20.500.11956/59026 | |
dc.description.abstract | Práce se zabývá implementací algoritmu pro nalezení generátoru skoro štěpitelných posloupností nerozložitelného a neprojektivního modulu algebry cest nad konečným toulcem. Algoritmus je zde implementován v algebraickém systému GAP (Groups, Algorithms, Programming) s využitím doplňujícího balíku QPA (Quivers and Path Algebras). Powered by TCPDF (www.tcpdf.org) | cs_CZ |
dc.description.abstract | This thesis deals with an implementation of algorithm for computation of generator of almost split sequences ending at an indecomposable nonprojective module of path algebra over finite quiver. Algorithm is implemented in algebra system GAP (Groups, Algorithms, Programming) with additional package QPA (Quivers and Path Algebras). Powered by TCPDF (www.tcpdf.org) | en_US |
dc.language | Čeština | cs_CZ |
dc.language.iso | cs_CZ | |
dc.publisher | Univerzita Karlova, Matematicko-fyzikální fakulta | cs_CZ |
dc.subject | skoro štěpitelné posloupnosti | cs_CZ |
dc.subject | teorie reprezentací | cs_CZ |
dc.subject | algoritmus | cs_CZ |
dc.subject | QPA | cs_CZ |
dc.subject | almost split sequences | en_US |
dc.subject | representation theory | en_US |
dc.subject | algorithm | en_US |
dc.subject | QPA | en_US |
dc.title | Algoritmy v teorii reprezentací | cs_CZ |
dc.type | diplomová práce | cs_CZ |
dcterms.created | 2013 | |
dcterms.dateAccepted | 2013-09-20 | |
dc.description.department | Department of Algebra | en_US |
dc.description.department | Katedra algebry | cs_CZ |
dc.description.faculty | Faculty of Mathematics and Physics | en_US |
dc.description.faculty | Matematicko-fyzikální fakulta | cs_CZ |
dc.identifier.repId | 92063 | |
dc.title.translated | Algorithms in Representation Theory | en_US |
dc.contributor.referee | Růžička, Pavel | |
dc.identifier.aleph | 001626911 | |
thesis.degree.name | Mgr. | |
thesis.degree.level | navazující magisterské | cs_CZ |
thesis.degree.discipline | Mathematical structures | en_US |
thesis.degree.discipline | Matematické struktury | cs_CZ |
thesis.degree.program | Matematika | cs_CZ |
thesis.degree.program | Mathematics | en_US |
uk.thesis.type | diplomová práce | cs_CZ |
uk.taxonomy.organization-cs | Matematicko-fyzikální fakulta::Katedra algebry | cs_CZ |
uk.taxonomy.organization-en | Faculty of Mathematics and Physics::Department of Algebra | en_US |
uk.faculty-name.cs | Matematicko-fyzikální fakulta | cs_CZ |
uk.faculty-name.en | Faculty of Mathematics and Physics | en_US |
uk.faculty-abbr.cs | MFF | cs_CZ |
uk.degree-discipline.cs | Matematické struktury | cs_CZ |
uk.degree-discipline.en | Mathematical structures | en_US |
uk.degree-program.cs | Matematika | cs_CZ |
uk.degree-program.en | Mathematics | en_US |
thesis.grade.cs | Velmi dobře | cs_CZ |
thesis.grade.en | Very good | en_US |
uk.abstract.cs | Práce se zabývá implementací algoritmu pro nalezení generátoru skoro štěpitelných posloupností nerozložitelného a neprojektivního modulu algebry cest nad konečným toulcem. Algoritmus je zde implementován v algebraickém systému GAP (Groups, Algorithms, Programming) s využitím doplňujícího balíku QPA (Quivers and Path Algebras). Powered by TCPDF (www.tcpdf.org) | cs_CZ |
uk.abstract.en | This thesis deals with an implementation of algorithm for computation of generator of almost split sequences ending at an indecomposable nonprojective module of path algebra over finite quiver. Algorithm is implemented in algebra system GAP (Groups, Algorithms, Programming) with additional package QPA (Quivers and Path Algebras). Powered by TCPDF (www.tcpdf.org) | en_US |
uk.file-availability | V | |
uk.publication.place | Praha | cs_CZ |
uk.grantor | Univerzita Karlova, Matematicko-fyzikální fakulta, Katedra algebry | cs_CZ |
dc.identifier.lisID | 990016269110106986 | |