2015
DOI: 10.2140/ant.2015.9.1337
|View full text |Cite
|
Sign up to set email alerts
|

Schubert decompositions for quiver Grassmannians of tree modules

Abstract: ABSTRACT. Let Q be a quiver, M a representation of Q with an ordered basis B and e a dimension vector for Q. In this note we extend the methods of [7] to establish Schubert decompositions of quiver Grassmannians Gr e (M) into affine spaces to the ramified case, i.e. the canonical morphism F : T → Q from the coefficient quiver T of M w.r.t. B is not necessarily unramified.In particular, we determine the Euler characteristic of Gr e (M) as the number of extremal successor closed subsets of T 0 , which extends th… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

1
28
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5

Relationship

3
2

Authors

Journals

citations
Cited by 6 publications
(29 citation statements)
references
References 14 publications
(34 reference statements)
1
28
0
Order By: Relevance
“…If this was not the case, we can use the reverse order of scriptB, that is, exchange iB by rn+k+li, and relabel the vertices of Q correspondingly to exchange the roles of qk and ql, so that our assumption is satisfied. First proof : Theorem 4.1 of provides a cell decomposition of prefixGre̲false(Xfalse) into affine spaces provided that X admits an ordered polarization (cf. [, Section 3.3]) such that every relevant pair (cf.…”
Section: Cell Decomposition For Tame Quiversmentioning
confidence: 99%
See 4 more Smart Citations
“…If this was not the case, we can use the reverse order of scriptB, that is, exchange iB by rn+k+li, and relabel the vertices of Q correspondingly to exchange the roles of qk and ql, so that our assumption is satisfied. First proof : Theorem 4.1 of provides a cell decomposition of prefixGre̲false(Xfalse) into affine spaces provided that X admits an ordered polarization (cf. [, Section 3.3]) such that every relevant pair (cf.…”
Section: Cell Decomposition For Tame Quiversmentioning
confidence: 99%
“…[, Section 3.3]) such that every relevant pair (cf. [, Section 2.3]) is maximal for at most one arrow of Q (cf. [, Section 3.4]).…”
Section: Cell Decomposition For Tame Quiversmentioning
confidence: 99%
See 3 more Smart Citations