Selections Reprinted from Mathematical
نویسنده
چکیده
MR0004042 (2,309c) 20.0X Brauer, R.; Nesbitt, C. On the modular characters of groups. Annals of Mathematics. Second Series 42 (1941), 556–590. The authors first summarize the theory of modular characters of a finite group G as previously developed by them [Univ. of Toronto Studies, Math. Series, no. 4, 1937]. If an element of G is defined to be p-regular when its order is prime to p, one of the important results in this theory is that the number of distinct absolutely irreducible modular representations of G is equal to the number of classes of conjugate p-regular elements of G. The principal problem considered in this paper is the reduction of an ordinary representation of G when the coefficients are taken in a field of characteristic p. It is proved that, if g = pag′, where (g′, p) = 1 and g is the order of G, then an ordinary irreducible representation Zi of degree zi ≡ 0 (mod p) remains irreducible as a modular representation and the character ζ of Zi vanishes for all elements of an order divisible by p. The theory of “blocks,” which is essential to the argument, cannot be explained here. As in the ordinary theory, the Kronecker product of two modular representations of G yields a new modular representation whose reduction is discussed. It is shown that the number of self-contragradient modular characters is equal to the number of self-reciprocal p-regular classes of G. Again, there is a modular theory corresponding to the ordinary theory relating the representations of G to those of a subgroup H. As would be expected, the analogy is very close. The paper concludes with a number of special cases and applications of the theory to GLH(2, p), SLH(2, p) and LF (2, p). G. de B. Robinson From MathSciNet, July 2016
منابع مشابه
Ernest Michael and Theory of Selections 3 24
For a large number of those working in topology, functional analysis, multivalued analysis, approximation theory, convex geometry, mathematical economics, control theory, and several other areas, the year 1956 has always been strongly connected with the publication by Ernest Michael of two fundamental papers on continuous selections which appeared in the Annals of Mathematics [4] [5]. With suff...
متن کاملClusterability in Signed Graphs Selections from A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas Electronic Journal of Combinatorics: Dynamic Surveys in Combinatorics
متن کامل
Other Matroids on Graphs and Signed, Gain, and Biased Graphs Selections from A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas
متن کامل
Ideal Point Distributions, Best Mode Selections and Optimal Spatial Partitions via Centroidal Voronoi Tessellations
There are many new applications of the centroidal Voronoi tessellations that come to life in recent years, along with more mathematical understandings and new algorithmic advances in their efficient computation. Some examples are presented in this paper as an illustration with an emphasis on the construction of ideal point distributions, best mode selections and optimal spatial partitions.
متن کاملThe DeltaUp Constraint Solver : Correctness Proof
The DeltaBlue algorithm is known as a fast incremental constraint solver based on local propagation and is widely used for constructing graphical user interface and algorithm animation. The primary tasks of the planning phase of DeltaBlue are method selections. In this paper, we prove that DeltaUp, which is a modi cation of DeltaBlue, minimizes the number of method selections in every planning ...
متن کامل