Search results for "init"
showing 10 items of 6629 documents
Finite groups with subgroups supersoluble or subnormal
2009
Abstract The aim of this paper is to study the structure of finite groups whose non-subnormal subgroups lie in some subclasses of the class of finite supersoluble groups.
A Local Approach to Certain Classes of Finite Groups
2003
Abstract We develop several local approaches for the three classes of finite groups: T-groups (normality is a transitive relation) and PT-groups (permutability is a transitive relation) and PST-groups (S-permutability is a transitive relation). Here a subgroup of a finite group G is S-permutable if it permutes with all the Sylow subgroup of G.
Symbolic Dynamics of Geodesic Flows on Trees
2019
In this chapter, we give a coding of the discrete-time geodesic ow on the nonwandering sets of quotients of locally finite simplicial trees X without terminal vertices by nonelementary discrete subgroups of Aut(X) by a subshift of finite type on a countable alphabet.
Nilpotent length and system permutability
2022
Abstract If C is a class of groups, a C -injector of a finite group G is a subgroup V of G with the property that V ∩ K is a C -maximal subgroup of K for all subnormal subgroups K of G. The classical result of B. Fischer, W. Gaschutz and B. Hartley states the existence and conjugacy of F -injectors in finite soluble groups for Fitting classes F . We shall show that for groups of nilpotent length at most 4, F -injectors permute with the members of a Sylow basis in the group. We shall exhibit the construction of a Fitting class and a group of nilpotent length 5, which fail to satisfy the result and show that the bound is the best possible.
Generalised norms in finite soluble groups
2014
Abstract We give a framework for a number of generalisations of Baerʼs norm that have appeared recently. For a class C of finite nilpotent groups we define the C -norm κ C ( G ) of a finite group G to be the intersection of the normalisers of the subgroups of G that are not in C . We show that those groups for which the C -norm is not hypercentral have a very restricted structure. The non-nilpotent groups G for which G = κ C ( G ) have been classified for some classes. We give a classification for nilpotent classes closed under subgroups, quotients and direct products of groups of coprime order and show the known classifications can be deduced from our classification.
A submatrix of the character table
2000
Let G be a finite group and let p be a prime number. We consider the Submatrix of the character table of G whose rows are indexed by the characters in blocks of maximal defect, and whose columns are indexed by the conjugacy classes of P′-size. We prove that this matrix has maximum rank.
Running time to recognize nonregular languages by 2-way probabilistic automata
1991
R. Freivalds proved that the language {0m1m} can be recognized by 2-way probabilistic finite automata (2pfa) with arbitrarily high probability 1-ɛ. A.G.Greenberg and A.Weiss proved that no 2pfa can recognize this language in expected time \(T(n) = c^\circ{(n)}\). For arbitrary languages C.Dwork and L.Stockmeyer showed somewhat less: if a language L is recognized by a 2pfa in expected time \(T(n) = c^{n^\circ{(1)} }\), then L is regular. First, we improve this theorem replacing the expected time by the time with probability 1-ɛ. On the other hand, time bound by C.Dwork and L.Stockmeyer cannot be improved: for arbitrary k≥2 we exhibit a specific nonregular language that can be recognized by 2…
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 .
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.
On the normal index of maximal subgroups in finite groups
1990
AbstractFor a maximal subgroup M of a finite group G, the normal index of M is the order of a chief factor H/K where H is minimal in the set of normal supplements of M in G. We use the primitive permutation representations of a finite group G and the normal index of its maximal subgroups to obtain results about the influence of the set of maximal subgroups in the structure of G.