Galois covering F:
Decomposition Classes for Representations of Tame Quivers
โ Scribed by Klaus Bongartz; Dirk Dudek
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 163 KB
- Volume
- 240
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
โฆ Synopsis
For the variety of representations of a tame quiver, we describe a finite stratification into smooth subvarieties that are invariant under the group of base changes and that admit smooth rational geometric quotients. A stratum consists of all representations that differ only in the parameters of the homogeneous indecomposable direct summands. For the special case of the loop our definition coincides ลฝ ลฝ.
. with the well-known bundles V. I. Arnold, Uspekhi Mat. Nauk 26 1971 , 101แ114 ลฝ or decomposition classes of matrices W. Borho and H. Kraft, Comment. Math. ลฝ . . Helยจ. 54 1979 , 61แ104 . แฎ 2001 Academic Press w x partition q . Interpreting a matrix as a k X module, we see that two
๐ SIMILAR VOLUMES
Let Qn denote the class of polynomials of degree less than or equal to n that are univalent in the unit disk D and which are of the form (1) with real coefficients. The class Qn is a subclass of T,, of polynomials of degree les8 than or equal to n normalized by (1) which are real if and only if z is
In this paper we introduce a set, denoted by D D A , for every commutative ring n A and every positive integer n. It is shown that the elements of this set can be used ลฝ . to give an explicit description of the class H H A introduced in van den Essen and n w ลฝ . x Hubbers J. Algebra 187 1997 , 214แ
There are however many interesting E-semiadequate semigroups that are not inverse, we consider various such examples arising from Schutzenberger products.
## Abstract We consider timeโdependent Stokes problems for the case of low Reynolds number in smoothly bounded domains. By using a finite difference time discretization, the problem is reduced to a sequence of steadyโstate Stokes problems. These boundary value problems are solved by means of hyperc