منابع مشابه
On the irreducible characters of Camina triples
The Camina triple condition is a generalization of the Camina condition in the theory of finite groups. The irreducible characters of Camina triples have been verified in the some special cases. In this paper, we consider a Camina triple (G,M,N) and determine the irreducible characters of G in terms of the irreducible characters of M and G/N.
متن کاملOn Squares of Irreducible Characters
We study the finite groups G with a faithful irreducible character whose square is a linear combination of algebraically conjugate irreducible characters of G. In conclusion, we offer another proof of one theorem of Isaacs-Zisser. There are a few papers treating the finite groups possessing an irreducible character whose powers are linear combinations of appropriate irreducible characters, for ...
متن کاملRemarks on Computing Irreducible Characters
0.1. Let G be a connected reductive algebraic group defined over a finite field Fq and let G(Fq) be the finite group of all Fq-rational points of G. We would like to present here a strategy for computing the character table of G(Fq) , under the assumption that p, the characteristic of Fq , is sufficiently large. We can assume that G has a simply connected derived group. Indeed, in the general c...
متن کاملOn Degrees of Irreducible Brauer Characters
Based on a large amount of examples, which we have checked so far, we conjecture that |G|p′ ≤ ∑ φ φ(1) 2 where p is a prime and the sum runs through the set of irreducible Brauer characters in characteristic p of the finite group G. We prove the conjecture simultaneously for p-solvable groups and groups of Lie type in the defining characteristic. In non-defining characteristics we give asymptot...
متن کاملStability of Kronecker Products of Irreducible Characters of the Symmetric Group
F. Murnaghan observed a long time ago that the computation of the decompositon of the Kronecker product χ(n−a,λ2,... ) ⊗ χ(n−b,μ2,... ) of two irreducible characters of the symmetric group into irreducibles depends only on λ = (λ2, . . . ) and μ = (μ2, . . . ), but not on n. In this note we prove a similar result: given three partitions λ, μ, ν of n we obtain a lower bound on n, depending on λ,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2000
ISSN: 0021-8693
DOI: 10.1006/jabr.1999.8121