We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
CONJUGATES FOR FINDING THE AUTOMORPHISM GROUP AND ISOMORPHISM OF DESIGN RESOLUTIONS.
- Authors
Topalova, Svetlana
- Abstract
Consider a combinatorial design D with a full automorphism group GD. The automorphism group G of a design resolution R is a subgroup of GD. This subgroup maps each parallel class of R into a parallel class of R. Two resolutions R1 and R2 of D are isomorphic if some automorphism from GD maps each parallel class of R1 to a parallel class of R2. If GD is very big, the computation of the automorphism group of a resolution and the check for isomorphism of two resolutions might be difficult. Such problems often arise when resolutions of geometric designs (the designs of the points and t-dimensional subspaces of projective or affine spaces) are considered. For resolutions with given automorphisms these problems can be solved by using some of the conjugates of the predefined automorphisms. The method is explained in the present paper and an algorithm for construction of the necessary conjugates is presented.
- Subjects
CONJUGATED systems; AUTOMORPHISM groups; ISOMORPHISM (Mathematics); CONFORMATIONAL isomerism; AFFINE geometry
- Publication
Serdica Journal of Computing, 2016, Vol 10, Issue 1, p79
- ISSN
1312-6555
- Publication type
Article