Article
Licensed
Unlicensed
Requires Authentication
Local factorisations of nonlocal Fitting classes
-
V. V. Shpakov
Published/Copyright:
September 30, 2008
Abstract
We consider general rules of constructing of local products of the Fitting classes with the use of nonlocal factors determined by the minimal elements of the Lockett section. We give a simple method to construct local Fitting classes which are factorised by nonlocal Fitting classes of some classes of π-groups and π′-groups. Applying the class 
, we simplify the procedure of construction of a nonlocal factor in the local product. It is shown that in the construction of the local product the nonlocal factor for the appropriate set of primes π is the Fitting class of the form 
, where 
is the minimal element of the Lockett section of the class . In this paper, we consider only finite solvable groups.
Received: 2007-06-04
Published Online: 2008-09-30
Published in Print: 2008-October
© de Gruyter 2008
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Finite probabilistic structures
- Consistency and an algorithm recognising inconsistency of realisations of a system of random discrete equations with two-valued unknowns
- A simple upper bound for the number of spanning trees of regular graphs
- Dynamic databases with optimal in order time complexity
- The closure operator with the equality predicate branching on the set of partial Boolean functions
- The fundamental difference between depth and delay
- Homomorphisms of shift registers into linear automata
- Provable security of digital signatures in the tamper-proof device model
- Local factorisations of nonlocal Fitting classes
Articles in the same Issue
- Finite probabilistic structures
- Consistency and an algorithm recognising inconsistency of realisations of a system of random discrete equations with two-valued unknowns
- A simple upper bound for the number of spanning trees of regular graphs
- Dynamic databases with optimal in order time complexity
- The closure operator with the equality predicate branching on the set of partial Boolean functions
- The fundamental difference between depth and delay
- Homomorphisms of shift registers into linear automata
- Provable security of digital signatures in the tamper-proof device model
- Local factorisations of nonlocal Fitting classes
