Premium
Tameness and complexity of finite group schemes
Author(s) -
Farnsteiner Rolf
Publication year - 2007
Publication title -
bulletin of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.396
H-Index - 48
eISSN - 1469-2120
pISSN - 0024-6093
DOI - 10.1112/blms/bdl006
Subject(s) - mathematics , group (periodic table) , finite group , pure mathematics , algebra over a field , chemistry , organic chemistry
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom