Groups with Restricted Conjugacy Classes

Let F C 0 be the class of all finite groups, and for each nonnegative integer n define by induction the group class FC^(n+1) consisting of all groups G such that for every element x the factor group G/CG ( ^G ) has the property FC^n . Thus FC^1 -groups are precisely groups with finite conjugacy classes, and the class FC^n obviously contains all finite groups and all nilpotent groups with class at most n. In this paper the known theory of FC-groups is taken as a model, and it is shown that many properties of FC-groups have an analogue in the class of FC^n -groups.

Description Reduction for Restricted Sets of (0,1) Matrices

* The research is supported partly by INTAS: 04-77-7173 project, http://www.intas.be

Practical, Computation Efficient High-Order Neural Network for Rotation and Shift Invariant Pattern Recognition

In this paper, a modification for the high-order neural network (HONN) is presented. Third order networks are considered for achieving translation, rotation and scale invariant pattern recognition. They require however much storage and computation power for the task. The proposed modified HONN takes into account a priori knowledge of the binary patterns that have to be learned, achieving significant gain in computation time and memory requirements. This modification enables the efficient computation of HONNs for image fields of greater that 100 × 100 pixels without any loss of pattern information.