Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
Boolean lattices of n-multiply Ω-bicanonical Fitting classes
-
O.V. Kamozina
Veröffentlicht/Copyright:
2. Februar 2016
Abstract
We describe the n-multiply Ω-bicanonical Fitting classes with Boolean lattice of Fitting subclasses. In particular, it is shown that in this case a Fitting class is directly decomposable with the use of the set of all atoms of its lattice. Here the notion of a direct decomposition plays the key role. Therefore we study direct decompositions separately and consider Ω-foliated Fitting classes with more general directions.
Published Online: 2016-2-2
Published in Print: 2002-10-1
© 2016 by Walter de Gruyter Berlin/Boston
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Editorial
- On permanents of random doubly stochastic matrices and asymptotic estimates of the nom hers of Latin rectangles and Latin squares
- On reversal of graph orientation
- The structure of an infinite Sylow subgroup in some periodic Shunkov groups
- Boolean lattices of multiply Ω-foliated formations
- Boolean lattices of n-multiply Ω-bicanonical Fitting classes
- On infinite groups with points
- Linear recurring sequence decimations with exponentially increasing step
- On ω-languages of special billiards
- On relative complexity of quantum and classical branching programs
- Forthcoming Papers
- Contents
Artikel in diesem Heft
- Editorial
- On permanents of random doubly stochastic matrices and asymptotic estimates of the nom hers of Latin rectangles and Latin squares
- On reversal of graph orientation
- The structure of an infinite Sylow subgroup in some periodic Shunkov groups
- Boolean lattices of multiply Ω-foliated formations
- Boolean lattices of n-multiply Ω-bicanonical Fitting classes
- On infinite groups with points
- Linear recurring sequence decimations with exponentially increasing step
- On ω-languages of special billiards
- On relative complexity of quantum and classical branching programs
- Forthcoming Papers
- Contents
