05.01.2013 Views

COMPUTATIONAL PROBLEMS IN ABSTRACT ALGEBRA.

COMPUTATIONAL PROBLEMS IN ABSTRACT ALGEBRA.

COMPUTATIONAL PROBLEMS IN ABSTRACT ALGEBRA.

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

84 K. Ferber and H. Jiirgensen<br />

The input for the programme rl is a paper tape with the following information<br />

about the lattice L(G) of subgroups of G:<br />

(1) the number k of classes of subgroups conjugate in G,<br />

(2) the number n of subgroups of G,<br />

(3) for each class Ki of conjugate subgroups Ui,, . . . , Ui?,, of G:<br />

(a) the order of these subgroups,<br />

(b) the list-numbers ii, . . ., i,,,<br />

(c) for each Via E Ki the list-numbers of its maximal subgroups in the<br />

numbering mentioned above.<br />

A paper tape with this information is provided, for example [l], by a programme<br />

CD implemented on an Electrologica Xl, which determines the lattice<br />

of subgroups of a group G from generators of G. The programme rl which<br />

has been implemented on a Zuse 222 reads this tape and punches a data<br />

tape for the plotter Zuse 264. For this the programme rl needs some additional<br />

information about the size and shape of the diagram wanted.<br />

The following data for the drawing may be prescribed :<br />

(1) the radius r of the circles representing subgroups (or half the side of<br />

the squares),<br />

(2) a (common) ordinate for the centres of circles representing a class Ki<br />

of conjugate subgroups,<br />

(3) an abscissa of these centres for each subgroup.<br />

If these data are not prescribed, the programme A puts r = 3 mm and<br />

tries to find suitable ordinates and abscissas. This is done in the following<br />

way.<br />

An ordinate is calculated as a function which depends linearly on the<br />

radius r and logarithmically on the order of the subgroups in Ki. The abscissas<br />

are calculated by the programme only under special conditions : G must<br />

be a p-group or a group of order pmq, where p and q are primes and p-= q;<br />

moreover, when U, V are subgroups of G, U maximal in V, 1 UI = p’q, 1 VI =<br />

p’q, it is not allowed that there exists a subgroup W of G with 1 W 1 = ptq<br />

and r-= t-= s. Geometrically this means that the diagram of the lattice of G<br />

must consist of at most two “branches”.<br />

For groups satisfying these requirements the set of all subgroups of order<br />

pj, 0 ~js m, is called the first branch B1, the set of all subgroups of order<br />

pjq is called the second branch B2 of L(G); the set of all subgroups whose<br />

order is the product of i primes is called the ith layer L, of L(G). Li n Bj is<br />

called the row R{.<br />

In order to calculate the abscissas for B1, the row R& containing the<br />

greatest number of subgroups is determined, and the abscissas for these<br />

subgroups are defined from left to right according to the sequence in which<br />

they occur on the data tape. All other rows are arranged in such a way that<br />

their geometrical centre has the same abscissa as the one of Rf;.<br />

,<br />

A programme for the drawing of lattices<br />

FIG. 2<br />

/<br />

/’<br />

The abscissas for the subgroups in B2 are determined in two main steps.<br />

First, consecutive rows of the first branch are considered. Let U be the<br />

first subgroup in the row Rt-_,, V be the last subgroup in Rt, W be the first<br />

subgroup in Rf . Then the abscissa x, for W is determined in such a way<br />

that Y is left of the line connecting U and W and has a certain distance<br />

from it (see Fig. 2). From x, the abscissa xCi of the centre of RF is found.<br />

This calculation is done for all i, 1 e is m, and the maximum x of the X,i<br />

found. Then all rows Ry are moved to the right until the abscissas of their<br />

centres coincide with x.<br />

Second, a similar procedure is performed for consecutive rows of the<br />

second branch. Let U be the last subgroup of Ri-_,, V be the first subgroup<br />

of Rf-, and W be the last subgroup of RF (see Fig. 3). It is tested if Vis to<br />

the right of the line connecting U and Wand has a proper distance from it.<br />

If not, the second branch is again moved to the right until this is the case.<br />

This procedure is performed for all i, 1 -= i < m + 1.<br />

From the maximal abscissas and ordinates the size of the diagram to be<br />

drawn is obtained. If this is too large, the radius r chosen for the circles is<br />

U e R;-,<br />

FIG. 3<br />

85

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!