Papers
Topics
Authors
Recent
Search
2000 character limit reached

A bideterminant basis for a reductive monoid

Published 24 Feb 2010 in math.RT and math.CO | (1002.4642v3)

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.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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.

Collections

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