• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 7
  • 2
  • Tagged with
  • 9
  • 9
  • 4
  • 4
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Homologie-Darstellungen des Wagoner-Komplexes und eine Steinberg-Darstellung von Gln(Z/plZ)

Petzold, Marko. January 2004 (has links)
Münster (Westfalen), Universiẗat, Diss., 2004. / Dateien im PDF-Format.
2

Lefschetz elements for Stanley-Reisner rings and annihilator numbers

Kubitzke, Martina. Unknown Date (has links)
Univ., Diss., 2009--Marburg.
3

Geometrische Modellierung mit Simplizialkomplexen vom CAD-Modell zur numerischen Analyse /

Bernreuther, Martin. January 2002 (has links)
Zugl.: Stuttgart, Univ., Diss., 2002.
4

C*-algebras associated with higher dimensional noncommutative simplicial complexes and their K-theory

Omran, Saleh Unknown Date (has links)
Münster (Westfalen), Univ., Diss., 2005 / Dateien im PDF-Format
5

A dual independence complex

Waßmer, Arnold. Unknown Date (has links) (PDF)
Techn. University, Diss., 2005--Berlin.
6

Simplicial complexes of graphs /

Jonsson, Jakob, January 1900 (has links)
Thesis (Ph. D.)--Royal Institute of Technology, Stockholm, 2005.
7

Foldable triangulations

Witte, Nikolaus. Unknown Date (has links)
Techn. University, Diss., 2007--Darmstadt.
8

Exchange Graphs via Quiver Mutation

Warkentin, Matthias 02 October 2014 (has links) (PDF)
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.
9

Exchange Graphs via Quiver Mutation

Warkentin, Matthias 11 June 2014 (has links)
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.

Page generated in 0.0782 seconds