- AutorIn
- Dipl.-Math. Matthias Warkentin
- Titel
- Exchange Graphs via Quiver Mutation
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:ch1-qucosa-153172
- Datum der Einreichung
- 01.08.2014
- Datum der Verteidigung
- 11.06.2014
- Abstract (EN)
- Inspired by Happel's question, whether the exchange graph and the simplicial complex of tilting modules over a quiver algebra are independent from the multiplicities of multiple arrows in the quiver, we study quantitative aspects of Fomin and Zelevinsky's quiver mutation rule. Our results turn out to be very useful in the mutation-infinite case for understanding combinatorial structures as the cluster exchange graph or the simplicial complex of tilting modules, which are governed by quiver mutation. Using a class of quivers we call forks we can show that any such quiver yields a tree in the exchange graph. This allows us to provide a good global description of the exchange graphs of arbitrary mutation-infinite quivers. In particular we show that the exchange graph of an acyclic quiver is a tree if (and in fact only if) any two vertices are connected by at least two arrows. Furthermore we give classification results for the simplicial complexes and thereby obtain a partial positive answer to Happel's question. Another consequence of our findings is a confirmation of Unger's conjecture about the infinite number of components of the tilting exchange graph in all but finitely many cases. Finally we generalise and conceptualise our results by introducing what we call "polynomial quivers", stating several conjectures about "polynomial quiver mutation", and giving proofs in special cases.
- Freie Schlagwörter (DE)
- Köchermutation, Austauschgraph, Baum, Cluster-Algebra, Cluster-Komplex, Kippmodul, simplizialer Komplex, Polynomköcher, Astgabel, mutations-unendlich, Mehrfachpfeil
- Freie Schlagwörter (EN)
- quiver mutation, exchange graph, tree, cluster algebra, cluster complex, tilting module, simplicial complex, polynomial quiver, fork, mutation-infinite, multiple arrow
- Klassifikation (DDC)
- 512
- 514
- Normschlagwörter (GND)
- Kombinatorik, Darstellungstheorie, Simplizialer Komplex, Graph, Baum
- GutachterIn
- Prof. Dr. Jan Schröer
- Prof. Dr. Robert Marsh
- Prof. Dr. Horst Martini
- BetreuerIn
- Prof. Dr. Dieter Happel
- Prof. Dr. Jan Schröer
- Den akademischen Grad verleihende / prüfende Institution
- Technische Universität Chemnitz, Chemnitz
- URN Qucosa
- urn:nbn:de:bsz:ch1-qucosa-153172
- Veröffentlichungsdatum Qucosa
- 02.10.2014
- Dokumenttyp
- Dissertation
- Sprache des Dokumentes
- Englisch