"Monoidal categorifications of cluster algebras"의 두 판 사이의 차이

수학노트
둘러보기로 가기 검색하러 가기
22번째 줄: 22번째 줄:
 
 
 
 
  
<h5>finite type quiver</h5>
+
<h5>finite type quiver classfication</h5>
  
 
* quiver has finite type of there are finitely many indecomposables
 
* quiver has finite type of there are finitely many indecomposables
33번째 줄: 33번째 줄:
  
 
A connected quiver Q has finite type iff corresponding graph is Dynking diagram (A,D,E)
 
A connected quiver Q has finite type iff corresponding graph is Dynking diagram (A,D,E)
 +
 +
 
 +
 +
 
 +
 +
<h5>Caldero-Chapoton formula</h5>
  
 
 
 
 

2011년 4월 13일 (수) 05:03 판

introduction
  • replace cluster variables by modules

 

 

notions
  • quiver : oriented graph
  • represetation of a quiver : collection of vector space and linear maps between them
  • homomorphism of 2 quiver representations
  • path algebra of a quiver
    • given a quiver Q, a path p is a sequence of arrows with some conditions
    • path algebra : set of all k-linear combinations of all paths (including e_i's)
    • p_1p_2 will correspond to a composition \(p_2\circ p_1\) of two maps (\(U\overset{P_2}{\rightarrow }V\overset{P_1}{\rightarrow }W\))
  • quiver representation is in fact, a representaion of path algebra of a quiver

 

 

finite type quiver classfication
  • quiver has finite type of there are finitely many indecomposables

 

 

\thm (Gabriel)

A connected quiver Q has finite type iff corresponding graph is Dynking diagram (A,D,E)

 

 

Caldero-Chapoton formula

 

 

 

periodicity conjecture

outline of a proof of the periodicity conjecture for pairs of Dynkin diagrams

 

 

 

history

 

 

related items

 

 

encyclopedia

 

 

books

 

 

 

expositions

 

 

articles

 

 

question and answers(Math Overflow)

 

blogs

 

 

experts on the field

 

 

links