Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

COMBINATORICS
2007

favoriteEmaildiscussreport

87views more COMBINATORICS 2007»

Recognizing Cluster Algebras of Finite Type

13 years 11 months ago

Recognizing Cluster Algebras of Finite Type

Download www.univie.ac.at

We compute the list of all minimal 2-inﬁnite diagrams, which are cluster algebraic analogues of extended Dynkin graphs.

Ahmet I. Seven

Real-time Traffic

Cluster Algebraic Analogues | COMBINATORICS 2007 | Dynkin Graphs | Minimal 2-inﬁnite Diagrams |

claim paper

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2007
Where	COMBINATORICS
Authors	Ahmet I. Seven

Comments (0)