1980
DOI: 10.1007/bf01403155
|View full text |Cite
|
Sign up to set email alerts
|

Infinite root systems, representations of graphs and invariant theory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

2
362
1
9

Year Published

1994
1994
2018
2018

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 375 publications
(374 citation statements)
references
References 20 publications
2
362
1
9
Order By: Relevance
“…The bounds given in Theorem 1.3 depend on dim(SI(Q, α)). Kac gave a formula (see [15]) for dim(SI(Q, α)) in terms of the canonical decomposition. There is in fact an efficient algorithm to compute the canonical decomposition due to the first author and Weyman, see [5].…”
Section: Bounds For Generating Semi-invariantsmentioning
confidence: 99%
“…The bounds given in Theorem 1.3 depend on dim(SI(Q, α)). Kac gave a formula (see [15]) for dim(SI(Q, α)) in terms of the canonical decomposition. There is in fact an efficient algorithm to compute the canonical decomposition due to the first author and Weyman, see [5].…”
Section: Bounds For Generating Semi-invariantsmentioning
confidence: 99%
“…But we can describe salient pieces. We start now from a multiple Actually, for quiver without relations we could have resorted to the more handy Hom complex provided by Kac [30] (for a review see [15]). So the method comes into its own for the case with relations.…”
Section: Conclusion and Further Directionsmentioning
confidence: 99%
“…Proof. We refer the reader to Kac [6] for undefined terms in the following proof. We deal first with the case where E and F are separable field extensions in the division algebra D. Over the algebraic closure k of k , we are considering = e =f copies of Ac and Ac embedded in Mn(k) so that minimal idempotents in = e =f k all have rank n/e and minimal idempotents in k have rank n/f.…”
Section: =1mentioning
confidence: 99%