### get_designs(km, lambda, first, number_of_solutions);

Gets the solutions in the interval [first..first+len-1] and spans the complete designs. Each design is returned as a list of blocks. See span_design for remarks on how the blocks of the design are ordered.

Example:

### span_design( grp, bb);

Spans the design given by a list of base blocks in bb under the group in grp. Returns a list of blocks of the design. The blocks come in the order of orbits of the base-block vector bb. Thus, they are not lexicographically ordered. There is no relabelling of points so the resulting incidence matrices still have the original group as group of automorphisms.

Example:

### design_orbits(solution_vector);

Converts a solution vector to a list of orbit indices.

Example:

gap> s[1]; [ 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0 ] gap> O := design_orbits(s[1]); [ 0, 3, 5, 7, 8, 11 ] gap>

### build_incidence_matrix(v, blocks);

Example:

Back
to the DISCRETA-GAP interface

Back to the typical GAP-session

Last updated: July 26, 1999, Evi Haberberger