TY - JOUR
T1 - One combinatorial construction in representation theory
AU - Malinin, Dmitry
N1 - Publisher Copyright:
© 2018 Elsevier Ltd
PY - 2019/8
Y1 - 2019/8
N2 - Let K be an extension of the field Qp of p-adic rationals, let OK be its ring of integers, and let G be a finite group. According to the classical Jordan–Zassenhaus Theorem, if K∕Qp is finite, every isomorphism class of KG-representation modules splits in a finite number of isomorphism classes of OKG-representation modules. We consider a p-group G of a given nilpotency class k>1 and the extension K∕Qp where K=Qp(ζp∞ ) obtained by adjoining all roots ζpi ,i=1,2,3,. of unity, and we use an explicit combinatorial construction of a faithful absolutely irreducible KG-module M to show that the number of OKG-isomorphism classes of OKG-representation modules, which are KG-equivalent to M, is infinite, and there are extra congruence properties for these OKG-modules.
AB - Let K be an extension of the field Qp of p-adic rationals, let OK be its ring of integers, and let G be a finite group. According to the classical Jordan–Zassenhaus Theorem, if K∕Qp is finite, every isomorphism class of KG-representation modules splits in a finite number of isomorphism classes of OKG-representation modules. We consider a p-group G of a given nilpotency class k>1 and the extension K∕Qp where K=Qp(ζp∞ ) obtained by adjoining all roots ζpi ,i=1,2,3,. of unity, and we use an explicit combinatorial construction of a faithful absolutely irreducible KG-module M to show that the number of OKG-isomorphism classes of OKG-representation modules, which are KG-equivalent to M, is infinite, and there are extra congruence properties for these OKG-modules.
UR - http://www.scopus.com/inward/record.url?scp=85042660285&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85042660285&partnerID=8YFLogxK
U2 - 10.1016/j.ejc.2018.02.007
DO - 10.1016/j.ejc.2018.02.007
M3 - Article
AN - SCOPUS:85042660285
SN - 0195-6698
VL - 80
SP - 287
EP - 295
JO - European Journal of Combinatorics
JF - European Journal of Combinatorics
ER -