pith. sign in

arxiv: 1002.4642 · v3 · pith:FY7F4TTQnew · submitted 2010-02-24 · 🧮 math.RT · math.CO

A bideterminant basis for a reductive monoid

classification 🧮 math.RT math.CO
keywords basisbideterminantalgebramonoidrationalreductivealternativearbitrary
0
0 comments X
read the original abstract

We use the rational tableaux introduced by Stembridge to give a bideterminant basis for a normal reductive monoid and for its variety of noninvertible elements. We also obtain a bideterminant basis for the full coordinate ring of the general linear group and for all its truncations with respect to saturated sets. Finally, we deduce an alternative proof of the double centraliser theorem for the rational Schur algebra and the walled Brauer algebra over an arbitrary infinite base field which was first obtained by Dipper, Doty and Stoll.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.