Please use this identifier to cite or link to this item: https://doi.org/10.1007/s10801-011-0298-0
DC FieldValue
dc.titleSpecht modules with abelian vertices
dc.contributor.authorLim, K.J.
dc.date.accessioned2014-10-28T02:46:09Z
dc.date.available2014-10-28T02:46:09Z
dc.date.issued2012-02
dc.identifier.citationLim, K.J. (2012-02). Specht modules with abelian vertices. Journal of Algebraic Combinatorics 35 (1) : 157-171. ScholarBank@NUS Repository. https://doi.org/10.1007/s10801-011-0298-0
dc.identifier.issn09259899
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/104179
dc.description.abstractIn this article, we consider indecomposable Specht modules with abelian vertices. We show that the corresponding partitions are necessarily p 2-cores where p is the characteristic of the underlying field. Furthermore, in the case of p≥3, or p=2 and μ is 2-regular, we show that the complexity of the Specht module S μ is precisely the p-weight of the partition μ. In the latter case, we classify Specht modules with abelian vertices. For some applications of the above results, we extend a result of M. Wildon and compute the vertices of the Specht module S (pp) for p≥3. © 2011 Springer Science+Business Media, LLC.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/s10801-011-0298-0
dc.sourceScopus
dc.subjectComplexity
dc.subjectSpecht module
dc.subjectVertex
dc.typeArticle
dc.contributor.departmentMATHEMATICS
dc.description.doi10.1007/s10801-011-0298-0
dc.description.sourcetitleJournal of Algebraic Combinatorics
dc.description.volume35
dc.description.issue1
dc.description.page157-171
dc.description.codenJAOME
dc.identifier.isiut000298351000008
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

5
checked on Jan 19, 2022

WEB OF SCIENCETM
Citations

5
checked on Jan 19, 2022

Page view(s)

72
checked on Jan 20, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.