next up previous
Next: Numbers of d.g. nearrings Up: D. G. Nearrings Previous: D. G. Nearrings

on groups with special properties, e.g., p-groups.

The problem of determining the number of polynomial functions on a given group can be attacked from various perspectives. One is to compute all these functions in an efficient way. This can be useful for small examples and helps testing and finding theoretical hypotheses.

An important starting point for theoretical research is the examination of the properties of the lattice of normal subgroups and their commutators. Here a lot of results from the area of universal algebra can be used successfully (cf. [7]). Another approach is a ``pointwise'' investigation of the group (i.e., playing with the elements of the group instead of its subgroups). Nilpotent groups and in particular p-groups are a point where these different approaches come together. Efficient algorithms are known for p-groups: structure theory, as well as an elementary (``pointwise'') analysis of p-groups are heavily investigated areas.

Juergen Ecker
Wed May 13 09:13:56 CEST 1998