Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 44 for “"Double Coset Enumeration"”.

  1. Symmetric Presentations and Double Coset Enumeration

    … $S_{5}$, respectively, using our technique of double coset enumeration. All of the symmetric presentations given are original to the best of our knowledge.

    csusb Repository record for Symmetric Presentations and Double Coset Enumeration (opens in a new tab)

  2. A parallel algorithm to solve the mathematical problem "double coset enumeration of S₂₄ over M₂₄"

    … new parallel algorithm that computes all single cosets in the double coset M₂₄ P M₂₄, where P is a permutation on n points of a certain cycle structure, and M₂₄ is the Mathieu group related to a Steiner system S(5, 8, 24) as its automorphism group. The purpose of this work is not to replace the …

    csusb Repository record for A parallel algorithm to solve the mathematical problem "double coset enumeration of S₂₄ over M₂₄" (opens in a new tab)

  3. A parallel algorithm to solve the mathematical problem "double coset enumeration of S₂₄ over M₂₄"

    … new parallel algorithm that computes all single cosets in the double coset M₂₄ P M₂₄, where P is a permutation on n points of a certain cycle structure, and M₂₄ is the Mathieu group related to a Steiner system S(5, 8, 24) as its automorphism group. The purpose of this work is not to replace the …

    csusb-retro Repository record for A parallel algorithm to solve the mathematical problem "double coset enumeration of S₂₄ over M₂₄" (opens in a new tab)

  4. SYMMETRIC GENERATIONS AND AN ALGORITHM TO PROVE RELATIONS

    … by lifting 5:11 onto it.We manually perform Double Coset Enumeration of 3:(2×S5) over D12to create its Cayley graph. This is achieved by solving many word problems. TheCayley graph is used to find a permutation representation of 3:(2×S5). We alsoperform Double Coset Enumeration S3 × A5 over …

    csusb Repository record for SYMMETRIC GENERATIONS AND AN ALGORITHM TO PROVE RELATIONS (opens in a new tab)

  5. Progenitors Involving Simple Groups

    … higher fields and orders. \\ We will also do the double coset enumeration of S5 over D6, S6 over 5 : 4, A_5 x A_5 over (5:2)^{*}5, and go on to also do the double coset enumeration over maximal subgroups for larger constructions. We will also do the construction of sporadic group M22 over maximal …

    csusb Repository record for Progenitors Involving Simple Groups (opens in a new tab)

  6. Homomorphic images of semi-direct products

    … groups and give useful techniques to perform double coset enumeration of groups with symmetric presentations over their control groups.

    csusb Repository record for Homomorphic images of semi-direct products (opens in a new tab)

  7. Homomorphic images of semi-direct products

    … groups and give useful techniques to perform double coset enumeration of groups with symmetric presentations over their control groups.

    csusb-retro Repository record for Homomorphic images of semi-direct products (opens in a new tab)

  8. Symmetric generation of finite homomorphic images?

    … of this thesis was to present the technique of double coset enumeration and apply it to construct finite homomorphic images of infinite semidirect products. Several important homomorphic images include the classical groups, the Projective Special Linear group and the Derived Chevalley group were …

    csusb Repository record for Symmetric generation of finite homomorphic images? (opens in a new tab)

  9. Symmetric generation of finite homomorphic images?

    … of this thesis was to present the technique of double coset enumeration and apply it to construct finite homomorphic images of infinite semidirect products. Several important homomorphic images include the classical groups, the Projective Special Linear group and the Derived Chevalley group were …

    csusb-retro Repository record for Symmetric generation of finite homomorphic images? (opens in a new tab)

  10. A study of finite symmetrical groups

    … : A₆, and 3*⁵ : C₅ The technique of manual of double coset enumeration is used to construct several groups by hand and computer-based proofs are given for the isomorphism types of the groups that are not constructed.

    csusb Repository record for A study of finite symmetrical groups (opens in a new tab)

  11. A study of finite symmetrical groups

    … : A₆, and 3*⁵ : C₅ The technique of manual of double coset enumeration is used to construct several groups by hand and computer-based proofs are given for the isomorphism types of the groups that are not constructed.

    csusb-retro Repository record for A study of finite symmetrical groups (opens in a new tab)

  12. Symmetrically generated groups

    … presentations. In particular, the technique of double coset enumeration is used to manually construct J₃ : 2, the automorphism group of the Janko group J₃, and represent every element of the group as a permutation of PSL₂ (16) : 4, on 120 letters, followed by a word of length at most 3.

    csusb Repository record for Symmetrically generated groups (opens in a new tab)

  13. Symmetrically generated groups

    … presentations. In particular, the technique of double coset enumeration is used to manually construct J₃ : 2, the automorphism group of the Janko group J₃, and represent every element of the group as a permutation of PSL₂ (16) : 4, on 120 letters, followed by a word of length at most 3.

    csusb-retro Repository record for Symmetrically generated groups (opens in a new tab)

  14. Symmetric representation of elements of finite groups

    … then be constructed by the technique of manual double coset enumeration.

    csusb Repository record for Symmetric representation of elements of finite groups (opens in a new tab)

  15. Symmetric generation of finite groups

    Advantages of the double coset enumeration technique include its use to represent group elements in a convenient shorter form than their usual permutation representations and to find nice permutation representations for groups. In this thesis we construct, by hand, several groups, including U₃(3) : …

    csusb Repository record for Symmetric generation of finite groups (opens in a new tab)

  16. Symmetric representation of elements of finite groups

    … then be constructed by the technique of manual double coset enumeration.

    csusb-retro Repository record for Symmetric representation of elements of finite groups (opens in a new tab)

  17. Symmetric generation of finite groups

    Advantages of the double coset enumeration technique include its use to represent group elements in a convenient shorter form than their usual permutation representations and to find nice permutation representations for groups. In this thesis we construct, by hand, several groups, including U₃(3) : …

    csusb-retro Repository record for Symmetric generation of finite groups (opens in a new tab)

  18. Symmetric Generation

    … These groups are constructed through the manual double coset enumeration method. We will examine how to construct progenitors for wreath products.

    csusb Repository record for Symmetric Generation (opens in a new tab)

  19. MANUAL SYMMETRIC GENERATION

    … We construct these groups through the method of double coset enumeration paying special attention to the proving of each relation.

    csusb Repository record for MANUAL SYMMETRIC GENERATION (opens in a new tab)

  20. Images of Permutation and Monomial Progenitors

    … We have also constructed, using the technique of double coset enumeration, the following groups, L_2(11), S(4,3):2, M11, and PGL(2,11). The isomorphism class of each of the finite images is also given.

    csusb Repository record for Images of Permutation and Monomial Progenitors (opens in a new tab)

Page 1 of 3