Joachim Neubüser
ABSTRACT
Both special purpose programs and more general systems have been implemented for the study of groups. The special programs were in most cases designed for calculations occurring in the investigation of very big finite groups, such as some of the newly discovered simple groups. The general systems in most cases allow a fairly detailed analysis of comparatively small groups only. Of course, general systems can be used to construct examples for teaching and for testing hypotheses, but often the more detailed structure of smaller subgroups of big groups, e.g., their Sylow subgroups, is needed. Another application of such a system, namely, to the classification of crystallographic groups and lattices in 4-dimensional space will be emphasized.
Index Terms
- Some applications of group theoretical programs
Recommendations
Compound orthomorphisms of the cyclic group
An orthomorphism @k of Z"n is a permutation of Z"n such that i@__ __@k(i)-i is also a permutation. We say @k is canonical if @k(0)=0 and define z"n to be the number of canonical orthomorphisms of Z"n. If n=dt and @k(i)=@k(j)(modd) whenever i=j(modd) ...
Generalized quadrangles admitting a sharply transitive Heisenberg group
All known finite generalized quadrangles that admit an automorphism group acting sharply transitively on their point set arise by Payne derivation from thick elation generalized quadrangles of order s with a regular point. In these examples only two ...
Group-theoretical generalization of necklace polynomials
Let G be a group, U a subgroup of G of finite index, X a finite alphabet and q an indeterminate. In this paper, we study symmetric polynomials M G ( X , U ) and $M_{G}^{q}(X,U)$ which were introduced as a group-theoretical generalization of necklace ...
Comments