Titlebook: Modular Representation Theory of Finite Groups; Peter Schneider Textbook 2013 Springer-Verlag London 2013 Brauer Correspondence.Burnside R

加冕

書目名稱Modular Representation Theory of Finite Groups影響因子(影響力)




書目名稱Modular Representation Theory of Finite Groups影響因子(影響力)學(xué)科排名




書目名稱Modular Representation Theory of Finite Groups網(wǎng)絡(luò)公開度




書目名稱Modular Representation Theory of Finite Groups網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Modular Representation Theory of Finite Groups被引頻次




書目名稱Modular Representation Theory of Finite Groups被引頻次學(xué)科排名




書目名稱Modular Representation Theory of Finite Groups年度引用




書目名稱Modular Representation Theory of Finite Groups年度引用學(xué)科排名




書目名稱Modular Representation Theory of Finite Groups讀者反饋




書目名稱Modular Representation Theory of Finite Groups讀者反饋學(xué)科排名

雪上輕舟飛過

Loathe

https://doi.org/10.1007/978-1-4471-4832-6Brauer Correspondence; Burnside Ring; Cartan-Brauer Triangle; Representation Theory; finite Groups

BACLE

Peter SchneiderProvides a concise introduction to modular representation theory.Is aimed at students at masters level.Compares group theoretic and module theoretic concepts.Includes supplementary material:

interrupt

sed-rate

Textbook 2013 in two distinct flavours. In the ‘semisimple case‘ (for example?over the field of complex numbers) one can use character theory to completely understand the representations. This by far is not sufficient when the characteristic of the field divides the order of the group..Modular Representation The

山羊

inhibit

Limpid

吸引力

Montgomery Arithmetic over Gaussian Integers,tographic system using Gaussian integers. Such a cryptographic system is presented in?[103, 104]. Similarly, a Rabin cryptographic system was previously considered over Gaussian integers in?[105, 106]. Moreover, coding applications over Gaussian integers?[18, 19, 40, 107–109] could also benefit from