2010
DOI: 10.1007/s10801-010-0248-2
|View full text |Cite
|
Sign up to set email alerts
|

On dominance and minuscule Weyl group elements

Abstract: Abstract. Fix a Dynkin diagram and let λ be a coweight. When does there exist an element w of the corresponding Weyl group such that w is λ-minuscule and w(λ) is dominant? We answer this question for general Coxeter groups. We express and prove these results using a variant of Mozes's game of numbers.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
3
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 23 publications
0
5
0
Order By: Relevance
“…In particular, they thank Sam Payne for a helpful discussion there leading to the formulation of Proposition 5.20, and thank Shaked Koplewitz for allowing them to sketch his proof of Proposition 6. 19. The third author also thanks T. Schedler for helpful comments and gratefully acknowledges partial support by NSF grant DMS-1001933.…”
Section: Acknowledgmentsmentioning
confidence: 95%
See 1 more Smart Citation
“…In particular, they thank Sam Payne for a helpful discussion there leading to the formulation of Proposition 5.20, and thank Shaked Koplewitz for allowing them to sketch his proof of Proposition 6. 19. The third author also thanks T. Schedler for helpful comments and gratefully acknowledges partial support by NSF grant DMS-1001933.…”
Section: Acknowledgmentsmentioning
confidence: 95%
“…root system Φ ∨ . Looping sequences were characterized by Eriksson [15, §3.2], and studied further by Gashi and Schedler [19], and by Gashi, Schedler and Speyer [20].…”
Section: Chip Firing With Cartan Matricesmentioning
confidence: 99%
“…2.7]) stating that in the usual partial order of σ-dominant weights, a weight ν covers another one ν ′ if and only if the difference ν − ν ′ is a root that is positive with respect to σ. In §3 we recall the numbers game with a cutoff (from [Gas08a]; see also [GS09]), which gives a useful language to prove Theorem 1.12. The proof of the theorem is then given in § §4 and 5.…”
Section: Introduction and Statement Of Main Resultsmentioning
confidence: 99%
“…In order to prove Theorem 1.4, we use the language of the numbers game with a cutoff, from [Gas08b] (see also [GS09]). In this section we recall what we will need.…”
Section: The Numbers Game With a Cutoffmentioning
confidence: 99%
See 1 more Smart Citation