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 13 of 13 for “"Metabelian Groups"”.

  1. Just Non-Metabelian Groups

    Made available in DSpace on 2014-12-14T13:09:33Z (GMT). No. of bitstreams: 1 7714986.pdf: 1642604 bytes, checksum: e963473fce3d399232fa662abefe156b (MD5) Previous issue date: 1977

    uiuc Repository record for Just Non-Metabelian Groups (opens in a new tab)

  2. Metabelian Groups of Order P('10)

    Made available in DSpace on 2014-12-05T21:50:20Z (GMT). No. of bitstreams: 1 6200604.pdf: 1220146 bytes, checksum: a1df3b27509658c8cc3ff191950e7e51 (MD5) Previous issue date: 1961

    uiuc Repository record for Metabelian Groups of Order P('10) (opens in a new tab)

  3. On Some Metabelian Groups of Order P('10)

    Made available in DSpace on 2014-12-05T21:50:21Z (GMT). No. of bitstreams: 1 6200675.pdf: 1310319 bytes, checksum: 18e7d179802caaa34901b139253a031f (MD5) Previous issue date: 1961

    uiuc Repository record for On Some Metabelian Groups of Order P('10) (opens in a new tab)

  4. On Metabelian Groups of Order P('10) With Five Generators

    Made available in DSpace on 2014-12-05T21:50:19Z (GMT). No. of bitstreams: 1 6104290.pdf: 1556461 bytes, checksum: f42f5588547dec8905c7e05209ac6790 (MD5) Previous issue date: 1961

    uiuc Repository record for On Metabelian Groups of Order P('10) With Five Generators (opens in a new tab)

  5. Some Metabelian Groups of Order P('10) and Related Groups of Order P('11)

    Made available in DSpace on 2014-12-05T21:50:21Z (GMT). No. of bitstreams: 1 6202889.pdf: 1258594 bytes, checksum: bfc01ed0251d235dac7c41ccaf10c673 (MD5) Previous issue date: 1962

    uiuc Repository record for Some Metabelian Groups of Order P('10) and Related Groups of Order P('11) (opens in a new tab)

  6. Solving Algorithmic Problems in Finitely Presented Groups via Machine Learning

    … applied to algorithmic problems in free groups. In this dissertation, we seek to extend these techniques to finitely presented non-free groups, in particular to polycyclic and metabelian groups that are of interest to non-commutative cryptography.</p> <p>As a prototypical example, we …

    cuny-grad Repository record for Solving Algorithmic Problems in Finitely Presented Groups via Machine Learning (opens in a new tab)

  7. Bounds on the genus of Riemann surfaces under certain group actions

    … the range of the function σ can be filled using metabelian groups. In this thesis, we determine the symmetric genus of several infinite families of non-abelian and non-dihedral metacyclic groups, which are a subset of metabelian groups, including the families Cm:C2, Cm : Cp with p an odd prime, …

    auckland-ms Repository record for Bounds on the genus of Riemann surfaces under certain group actions (opens in a new tab)

  8. Subnormal Structure of Finite Soluble Groups

    … the intersection of normalizers of subnormal subgroups, is non-trivial in any finite group and thus gives rise to a series whose length is a measure of the complexity of a group's subnormal structure. Another measure, akin to the nilpotency class of nilpotent groups, arises from the strong …

    aus-cath Repository record for Subnormal Structure of Finite Soluble Groups (opens in a new tab)

  9. Subnormal Structure of Finite Soluble Groups

    … the intersection of normalizers of subnormal subgroups, is non-trivial in any finite group and thus gives rise to a series whose length is a measure of the complexity of a group's subnormal structure. Another measure, akin to the nilpotency class of nilpotent groups, arises from the strong …

    anu Repository record for Subnormal Structure of Finite Soluble Groups (opens in a new tab)