Skip Navigation



Bulletin of the London Mathematical Society Advance Access published online on December 15, 2006
Bulletin of the London Mathematical Society, doi:10.1112/blms/bdl006
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
39/1/63    most recent
bdl006v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Farnsteiner, R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2006 London Mathematical Society

Tameness and complexity of finite group schemes

Rolf Farnsteiner

Fakultät für Mathematik, Universität Bielefeld, Postfach 10 01 31. 33501 Bielefeld, Germany

Received 14 July 2005. Revision received 24 April 2006.

Using a representation-theoretic interpretation of support varieties due to Friedlander and Pevtsova (Amer. J. Math. 127 (2005) 379–420; Erratum Amer. J. Math. 128 (2006) 1067–1068, we show that the complexity of tame blocks of finite group schemes is bounded by 2. In this context, our result salvages a theorem by Rickard (Bull. London Math. Soc. 22 (1990) 540–546), the proof of which is flawed.

Correspondence: rolf{at}math.uni-bielefeld.de


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Int Math Res NoticesHome page
I. Bagci, J. R. Kujawa, and D. K. Nakano
Cohomology and Support Varieties for Lie Superalgebras of Type W(n)
Int Math Res Notices, January 1, 2008; 2008(rnn115): rnn115 - 42.
[Abstract] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.