The combinatorics of orbital varieties closures of nilpotent order 2 in sln

Research output: Contribution to journalArticlepeer-review

Abstract

We consider two partial orders on the set of standard Young tableaux. The first one is induced to this set from the weak right order on symmetric group by Robinson-Schensted algorithm. The second one is induced to it from the dominance order on Young diagrams by considering a Young tableau as a chain of Young diagrams. We prove that these two orders of completely different nature coincide on the subset of Young tableaux with 2 columns or with 2 rows. This fact has very interesting geometric implications for orbital varieties of nilpotent order 2 in special linear algebra sln.

Original languageEnglish
JournalElectronic Journal of Combinatorics
Volume12
Issue number1 R
DOIs
StatePublished - 6 May 2005

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'The combinatorics of orbital varieties closures of nilpotent order 2 in sln'. Together they form a unique fingerprint.

Cite this