Search results for "Normal"

showing 10 items of 2571 documents

The minimal number of characters over a normal p-subgroup

2007

Abstract If N is a normal p-subgroup of a finite group G and θ ∈ Irr ( N ) is a G-invariant irreducible character of N, then the number | Irr ( G | θ ) | of irreducible characters of G over θ is always greater than or equal to the number k p ′ ( G / N ) of conjugacy classes of G / N consisting of p ′ -elements. In this paper, we investigate when there is equality.

CombinatoricsFinite groupAlgebra and Number TheoryCharacter (mathematics)Brauer's theorem on induced charactersConjugacy classCharacter tableCharactersCounting charactersFinite groupsNormal p-subgroupsMathematicsJournal of Algebra
researchProduct

The McKay conjecture and Galois automorphisms

2004

The main problem of representation theory of finite groups is to find proofs of several conjectures stating that certain global invariants of a finite group G can be computed locally. The simplest of these conjectures is the ?McKay conjecture? which asserts that the number of irreducible complex characters of G of degree not divisible by p is the same if computed in a p-Sylow normalizer of G. In this paper, we propose a much stronger version of this conjecture which deals with Galois automorphisms. In fact, the same idea can be applied to the celebrated Alperin and Dade conjectures.

CombinatoricsFinite groupMathematics (miscellaneous)ConjectureStatistics Probability and UncertaintyInvariant (mathematics)AutomorphismMathematical proofCentralizer and normalizerRepresentation theory of finite groupsGroup representationMathematicsAnnals of Mathematics
researchProduct

Extensions of cocycles for hyperfinite actions and applications

1997

Given a countable, hyperfinite, ergodic and measure-preserving equivalence relationR on a standard probability space (X, ℬ, μ) and an elementW of the normalizerN (R) ofR, we investigate the problem of extendingR-cocycles to\(\bar R\), where\(\bar R\) is the relation generated byR andW. As an application, we obtain that for a Bernoulli automorphism the smallest family of natural factors in sense of [6] consists of all factors. Given an automorphism which is embeddable in a measurable flow and a compact, metric group, we show that for a typical cocycle we cannot lift the whole flow to the centralizer of the corresponding group extension.

CombinatoricsGroup extensionGeneral MathematicsErgodic theoryCountable setStandard probability spaceAutomorphismEquivalence (measure theory)Hyperfinite setCentralizer and normalizerMathematicsMonatshefte für Mathematik
researchProduct

Self-normalizing Sylow subgroups

2003

Using the classification of finite simple groups we prove the following statement: Let p > 3 p>3 be a prime, Q Q a group of automorphisms of p p -power order of a finite group G G , and P P a Q Q -invariant Sylow p p -subgroup of G G . If C N G ( P ) / P ( Q ) \mathbf {C}_{\mathbf {N}_G(P)/P}(Q) is trivial, then G G is solvable. An equivalent formulation is that if G G has a self-normalizing Sylow p p -subgroup with p > 3 p >3 a prime, then G G is solvable. We also investigate the possibilities when p = 3 p=3 .

CombinatoricsNormal p-complementFinite groupLocally finite groupApplied MathematicsGeneral MathematicsSylow theoremsClassification of finite simple groupsAutomorphismMathematics
researchProduct

A Question of R. Maier Concerning Formations

1996

The formation f is said to be saturated if the group G belongs to f Ž . whenever the Frattini factor group GrF G is in f. Let P be the set of all prime numbers. A formation function is a Ž . function f defined on P such that f p is a, possibly empty, formation. A formation f is said to be a local formation if there exists a formation Ž function f such that f s G g G : if HrK is a chief factor of G and p < < Ž . Ž .. divides HrK , then GrC HrK g f p ; G is the class of all finite G groups. If f is a local formation defined by a formation function f , then Ž . we denote f s LF f and f is a local definition of f. Among all possible local definitions of a local formation f there exists exactly …

CombinatoricsNormal subgroupAlgebra and Number TheoryGroup (mathematics)Prime numberFunction (mathematics)QuotientMathematicsJournal of Algebra
researchProduct

On prefrattini residuals

1998

All groups considered in the sequel are finite. Let (ℭ and denote the formations of groups which consist of collections of groups that respectively either split over each normal subgroup (nC-groups) or for which the groups do not possess nontrivial Frattini chief factors [8]. The purpose of this article is to develop and expand a concept that arises naturally with the residuals for these formations, namely each G-chief factor is non-complemented (Frattini). With respect to a solid set X of maximal subgroups, these properties are generalized respectively to so-called X-parafrattini (X-profrattini) normal subgroups for which each type is closed relative to products. The relationships among th…

CombinatoricsNormal subgroupAlgebraGeneral MathematicsMathematics
researchProduct

Blocks and Normal Subgroups

1998

CombinatoricsNormal subgroupCharacter (mathematics)Block (programming)B subgroupAlgebra over a fieldMathematics
researchProduct

Squaring a conjugacy class and cosets of normal subgroups

2015

CombinatoricsNormal subgroupConjugacy classApplied MathematicsGeneral MathematicsCosetTopologyMathematicsProceedings of the American Mathematical Society
researchProduct

On the Deskins index complex of a maximal subgroup of a finite group

1999

AbstractLet M be a maximal subgroup of a finite group G. A subgroup C of G is said to be a completion of M in G if C is not contained in M while every proper subgroup of C which is normal in G is contained in M. The set, I(M), of all completions of M is called the index complex of M in G. Set P(M) = {C ϵ I(M) ¦ C} is maximal in I(M) and G = CM. The purpose of this note is to prove: A finite group G is solvable if and only if, for each maximal subgroup M of G, P(M) contains element C with CK(C) nilpotent.

CombinatoricsNormal subgroupDiscrete mathematicsMathematics::Group TheoryNilpotentFinite groupMaximal subgroupAlgebra and Number TheorySubgroupIndex of a subgroupSubgroup CMathematicsJournal of Pure and Applied Algebra
researchProduct

A Note on the δ-length of Maximal Subgroups in Finite Soluble Groups

1994

CombinatoricsNormal subgroupGeneral MathematicsMathematicsMathematische Nachrichten
researchProduct