Papers
Topics
Authors
Recent
Search
2000 character limit reached

Gradedness of the set of rook placements in $A_{n-1}$

Published 5 Nov 2018 in math.RT and math.CO | (1811.01673v1)

Abstract: A rook placement is a subset of a root system consisting of positive roots with pairwise non-positive inner products. To each rook placement in a root system one can assign the coadjoint orbit of the Borel subgroup of a reductive algebraic group with this root system. Degenerations of such orbits induce a natural partial order on the set of rook placements. We study combinatorial structure of the set of rook placements in $A_{n-1}$ with respect to a slightly different order and prove that this poset is graded.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.