2002
DOI: 10.1016/s0021-8693(02)00148-5
|View full text |Cite
|
Sign up to set email alerts
|

Linkable Dynkin diagrams

Abstract: In this article we develop some aspects of the construction of new Hopf algebras found recently by Andruskiewitsch and Schneider [AS1]. There the authors classified (under some slight restrictions) all pointed finite dimensional Hopf algebras with coradical (Z/p) s . We contribute to this work by giving a closer description of the possible "exotic" linkings. * This work will be part of the author's Ph.D. thesis written under the supervision of Professor H.-J. Schneider. The author is a member of the Graduierte… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2002
2002
2009
2009

Publication Types

Select...
3
1
1

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 6 publications
0
5
0
Order By: Relevance
“…This is a Hopf algebra, cf. [D,AS5]. We order the vertices in the Dynkin diagram so that the root vectors of the k th component are e S k +i,S k +j , 1 ≤ i < j ≤ n k + 1, where S k = n 1 + · · · + n k−1 .…”
Section: The Mixed Casementioning
confidence: 99%
“…This is a Hopf algebra, cf. [D,AS5]. We order the vertices in the Dynkin diagram so that the root vectors of the k th component are e S k +i,S k +j , 1 ≤ i < j ≤ n k + 1, where S k = n 1 + · · · + n k−1 .…”
Section: The Mixed Casementioning
confidence: 99%
“…We collect some useful facts from [2,8]: any vertex i is linkable to at most one vertex j; if i, j are linkable, then q ii = q j j , q i j q ji = 1; if i and k, respectively, j and l, are linkable, then a i j = a kl , a ji = a lk .…”
Section: Preliminariesmentioning
confidence: 99%
“…ad c (x i ) 1−a i j (x j ) = 0, for all i ∼ j, i j, (8) x i x j − q i j x j x i = λ i j (1 − g i g j ), for all i ≁ j. (9) where ad c (x i )(x j ) = x i x j −q a i j x j x i .…”
Section: Hopf Algebra U(d λ 2 )mentioning
confidence: 99%
“…However, in the more general case where the relations (5.9) have a non-zero right side, one needs general linking data. See [13] for a combinatorial description of all linkings of Dynkin diagrams.…”
Section: Definition 57 -Let Us Fix a Decompositionmentioning
confidence: 99%
“…(iv) The question of finding all the possible linking elements attached to a fixed collection g i , χ i , 1 i θ, (a ij ) 1 i,j θ , is also of combinatorial nature, see Section 5, and also [13]. Once these two problems are solved effectively, the isomorphism classes of the Hopf algebras u(D) can be determined using [5,Prop.…”
Section: Introductionmentioning
confidence: 99%